Sciweavers

591 search results - page 32 / 119
» A constraint programming approach to cutset problems
Sort
View
CORR
1998
Springer
126views Education» more  CORR 1998»
13 years 8 months ago
Stable models and an alternative logic programming paradigm
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 ...
Victor W. Marek, Miroslaw Truszczynski
ICASSP
2011
IEEE
13 years 5 days ago
Worst-case based robust adaptive beamforming for general-rank signal models using positive semi-definite covariance constraint
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...
Haihua Chen, Alex B. Gershman
IOR
2006
173views more  IOR 2006»
13 years 8 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
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...
Jean-François Cordeau
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
14 years 8 months ago
RTL-Datapath Verification using Integer Linear Programming
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...
Raik Brinkmann, Rolf Drechsler
SIAMJO
2010
112views more  SIAMJO 2010»
13 years 3 months ago
A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...
Zhi-Quan Luo, Shuzhong Zhang