3082 search results - page 72 / 617 » New Bounds for the Controller Problem |
129
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
148
click to vote
EOR
2008
15 years 3 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
123
click to vote
ICNP
1998
IEEE
15 years 8 months ago
1998
IEEE
In Internet multicast, the set of receivers can be dynamic with receivers joining and leaving a group asynchronously and without the knowledge of the sources. The Internet today u...
139
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
130
Voted
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...