1671 search results - page 100 / 335 » On the Covering Steiner Problem |
91
Voted
MOR
2002
15 years 14 days ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
113
Voted
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
352
Voted
ICSE
2012
IEEE-ACM
13 years 3 months ago
2012
IEEE-ACM
—As smartphones become popular, manufacturers such as Samsung Electronics are developing smartphones with rich functionality such as a camera and photo editing quickly, which acc...
100
Voted
AAAI
2008
15 years 3 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
109
click to vote
ASPDAC
2009
ACM
15 years 4 months ago
2009
ACM
The number of vias generated during the global routing stage is a critical factor for the yield of final circuits. However, most global routers only approach the problem by chargin...