1964 search results - page 200 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
IS
2010
13 years 6 months ago
2010
Abstract--High level conceptual thought seems to be at the basis of the impressive human cognitive ability, and AI researchers aim to replicate this ability in artificial agents. C...
TALG
2010
13 years 2 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
IOR
2007
13 years 8 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
AAECC
2005
Springer
13 years 8 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
ICCCN
2008
IEEE
14 years 2 months ago
2008
IEEE
—We investigate the p-percent coverage problem in this paper and propose two algorithms to prolong network lifetime based on the fact that for some applications full coverage is ...