4171 search results - page 764 / 835 » Choice numbers of graphs |
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
USS
2004
15 years 1 months ago
2004
Disassembly is the process of recovering a symbolic representation of a program's machine code instructions from its binary representation. Recently, a number of techniques h...
NIPS
2003
15 years 1 months ago
2003
Consider a number of moving points, where each point is attached to a joint of the human body and projected onto an image plane. Johannson showed that humans can effortlessly det...
AAAI
1994
15 years 1 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
150
click to vote
IJCAI
1989
15 years 1 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...