Sciweavers

14739 search results - page 295 / 2948
» An optimization problem on the sphere
Sort
View
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
15 years 5 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
FOCS
2006
IEEE
15 years 5 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
CEC
2005
IEEE
15 years 5 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
EVOW
2004
Springer
15 years 4 months ago
Solving a Real-World Glass Cutting Problem
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
Jakob Puchinger, Günther R. Raidl, Gabriele K...
GECCO
2004
Springer
111views Optimization» more  GECCO 2004»
15 years 4 months ago
Cooperative Problem Solving Using an Agent-Based Market
A key problem in multi-agent systems research is identifying appropriate techniques to facilitate effective cooperation between agents. In this paper, we investigate the efficacy o...
David Cornforth, Michael Kirley