Sciweavers

6582 search results - page 147 / 1317
» The focus of attention problem
Sort
View
AMAI
1999
Springer
15 years 6 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
CEC
2007
IEEE
16 years 25 days ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
AAAI
2007
15 years 8 months ago
Measuring the Level of Transfer Learning by an AP Physics Problem-Solver
Transfer learning is the ability of an agent to apply knowledge learned in previous tasks to new problems or domains. We approach this problem by focusing on model formulation, i....
Matthew Klenk, Kenneth D. Forbus
ANOR
2011
117views more  ANOR 2011»
14 years 10 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
CSFW
2007
IEEE
16 years 25 days ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle