Sciweavers

2084 search results - page 351 / 417
» Set Constraints in Logic Programming
Sort
View
ANOR
2004
116views more  ANOR 2004»
13 years 8 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
MOR
2002
102views more  MOR 2002»
13 years 7 months ago
Facets of the Complementarity Knapsack Polytope
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
Ismael R. de Farias Jr., Ellis L. Johnson, George ...
TSP
2012
12 years 3 months ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
CADE
2007
Springer
14 years 8 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
CI
2000
114views more  CI 2000»
13 years 7 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...