14158 search results - page 299 / 2832 » Generalized switch-setting problems |
129
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
144
Voted
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
162
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
145
click to vote
ACSC
2008
IEEE
15 years 6 months ago
2008
IEEE
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
129
click to vote
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...