6036 search results - page 78 / 1208 » Web search solved |
97
Voted
HICSS
2007
IEEE
15 years 7 months ago
2007
IEEE
Today’s search engines retrieve tens of thousands of web pages in response to fairly simple query articulations. These pages are retrieved on the basis of the query terms occurr...
DAC
2005
ACM
16 years 1 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
108
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
122
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
111
Voted
AI
2003
Springer
15 years 6 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...