1579 search results - page 7 / 316 » How Good is the Crowd at |
IPPS
1994
IEEE
14 years 2 days ago
1994
IEEE
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
AAAI
2008
13 years 10 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
AAAI
2004
13 years 9 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is general...