1983 search results - page 237 / 397 » Competitive graph searches |
130
click to vote
CP
2001
Springer
15 years 7 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
128
click to vote
DCC
2004
IEEE
15 years 6 months ago
2004
IEEE
Compressed pattern matching is an emerging research area that addresses the following problem: given a file in compressed format and a pattern, report the occurrence(s) of the pat...
AIPS
2006
15 years 4 months ago
2006
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
124
click to vote
WWW
2010
ACM
15 years 3 months ago
2010
ACM
Many have speculated that classifying web pages can improve a search engine's ranking of results. Intuitively results should be more relevant when they match the class of a q...
ANOR
2005
15 years 2 months ago
2005
The pilot method as a meta-heuristic is a tempered greedy method aimed at obtaining better solutions while avoiding the greedy trap by looking ahead for each possible choice. Repea...