1040 search results - page 27 / 208 » Tools for modeling and solving search problems |
83
Voted
EVOW
2001
Springer
15 years 2 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
111
click to vote
ENTCS
2006
14 years 10 months ago
2006
While a lot of progress has been made in improving analyses and tools that aid software development, less effort has been spent on studying how such tools are commonly used in pra...
70
Voted
ESWS
2009
Springer
15 years 4 months ago
2009
Springer
The primary goal of the Semantic Web is to use URIs as a universal space to name anything, expanding from using URIs for webpages to URIs for “real objects and imaginary concepts...
76
Voted
COMPSAC
2006
IEEE
15 years 4 months ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
99
Voted
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...