2398 search results - page 391 / 480 » Constraint Programming and Graph Algorithms |
131
click to vote
COR
2007
15 years 2 months ago
2007
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
126
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
141
Voted
MDM
2009
Springer
15 years 9 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
131
Voted
GG
2010
Springer
15 years 16 days ago
2010
Springer
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...
130
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Being able to detect and recognize human activities is important for making personal assistant robots useful in performing assistive tasks. The challenge is to develop a system th...