591 search results - page 32 / 119 » A constraint programming approach to cutset problems |
160
Voted
CORR
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
124
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we develop a new approach to the robust beamforming for general-rank signal models. Our method is based on the worst-case performance optimization using a semi-de n...
134
click to vote
IOR
2006
15 years 3 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
141
Voted
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
122
Voted
SIAMJO
2010
14 years 10 months ago
2010
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...