Sciweavers

2061 search results - page 11 / 413
» The continuous knapsack set
Sort
View
CPAIOR
2010
Springer
15 years 2 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
AML
2008
54views more  AML 2008»
14 years 9 months ago
Potential continuity of colorings
Abstract. We say that a coloring c : []n 2 is continuous if it is continuous with respect to some second countable topology on . A coloring c is potentially continuous if it is co...
Stefan Geschke
ESOP
2000
Springer
15 years 1 months ago
Formalizing Implementation Strategies for First-Class Continuations
Abstract. We present the first formalization of implementation straor first-class continuations. The formalization hinges on abstract machines for continuation-passing style (CPS) ...
Olivier Danvy
IJCNN
2000
IEEE
15 years 2 months ago
The Inefficiency of Batch Training for Large Training Sets
Multilayer perceptrons are often trained using error backpropagation (BP). BP training can be done in either a batch or continuous manner. Claims have frequently been made that bat...
D. Randall Wilson, Tony R. Martinez
WSC
2004
14 years 11 months ago
A Near Optimal Approach to Quality of Service Data Replication Scheduling
This paper describes an approach to real-time decisionmaking for quality of service based scheduling of distributed asynchronous data replication. The proposed approach addresses ...
Kevin Adams, Denis Gracanin, Dusan Teodorovic