Sciweavers

4117 search results - page 31 / 824
» On the Satisfiability of Complex Constraints
Sort
View
CORR
2006
Springer
130views Education» more  CORR 2006»
14 years 9 months ago
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
Joseph Y. Halpern, Leandro Chaves Rêgo
CADE
2010
Springer
14 years 10 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
85
Voted
CORR
2010
Springer
93views Education» more  CORR 2010»
14 years 9 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu
AI
2006
Springer
14 years 9 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 1 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack