4377 search results - page 498 / 876 » Mass problems and randomness |
159
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
150
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
170
click to vote
AAAI
2007
15 years 9 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
198
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
159
click to vote
APLAS
2008
ACM
15 years 8 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...