1542 search results - page 283 / 309 » The metamathematics of random graphs |
FOCS
1998
IEEE
14 years 26 days ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
CONEXT
2007
ACM
14 years 17 days ago
2007
ACM
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
CP
2007
Springer
14 years 17 days ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
GECCO
2007
Springer
14 years 15 days ago
2007
Springer
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
ATAL
2006
Springer
14 years 11 days ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...