Sciweavers

581 search results - page 75 / 117
» Coordination in answer set programming
Sort
View
TOOLS
1999
IEEE
13 years 12 months ago
Cooperative Software Development: Concepts, Model and Tools
The development of large software systems demands intensive cooperation among multiple project team members with different responsibilities. The development process is often distr...
Josef Altmann, Gustav Pomberger
VMCAI
2007
Springer
14 years 1 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
FOCS
2005
IEEE
14 years 1 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
WIOPT
2010
IEEE
13 years 5 months ago
Iterative power and subcarrier allocation for maximizing WSMR in cellular OFDMA systems
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
Tao Wang, Luc Vandendorpe
LPNMR
2001
Springer
14 years 1 days ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä