6562 search results - page 143 / 1313 » Noetherianity and Combination Problems |
186
click to vote
EUROGP
2010
Springer
15 years 8 months ago
2010
Springer
We propose a new framework based on Genetic Programming (GP) to automatically decompose problems into smaller and simpler tasks. The framework uses GP at two levels. At the top lev...
158
click to vote
CEC
2005
IEEE
15 years 8 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 ...
184
click to vote
COR
2010
15 years 6 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
176
click to vote
EJC
2008
15 years 6 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
186
Voted
AI
2005
Springer
15 years 6 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...