4488 search results - page 46 / 898 » Focusing Search by Using Problem Solving Experience |
124
Voted
FLAIRS
2006
15 years 4 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
119
click to vote
IJKESDP
2010
15 years 1 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
152
Voted
CONSTRAINTS
2010
14 years 12 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
108
click to vote
AAAI
2007
15 years 4 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...
112
click to vote
COLT
2000
Springer
15 years 7 months ago
2000
Springer
Output coding is a general framework for solving multiclass categorization problems. Previous research on output codes has focused on building multiclass machines given predefine...