Sciweavers

1594 search results - page 221 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 4 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 3 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
WIOPT
2010
IEEE
15 years 1 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely
117
Voted
DAC
2004
ACM
15 years 8 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
121
Voted
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
15 years 7 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...