1672 search results - page 160 / 335 » Tightness problems in the plane |
201
click to vote
GECCO
2009
Springer
16 years 17 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
162
click to vote
FOCS
2006
IEEE
16 years 1 days ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
155
click to vote
ISMIR
2004
Springer
15 years 11 months ago
2004
Springer
The software sound synthesis is closely related to the Music N programs started with Music I in 1957. Although Music N has many advantages such as unit generators and a flexible ...
167
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
141
click to vote
CP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...