13376 search results - page 463 / 2676 » Problem Solving with |
131
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...
133
click to vote
DISOPT
2006
15 years 5 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
143
click to vote
FGCS
2000
15 years 4 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
150
Voted
CAEPIA
2009
Springer
15 years 6 months ago
2009
Springer
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...
140
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...