Sciweavers

740 search results - page 109 / 148
» Open Answer Set Programming with Guarded Programs
Sort
View
CI
2004
125views more  CI 2004»
13 years 7 months ago
Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory
This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized d...
Tran Cao Son, Enrico Pontelli
AIPS
2004
13 years 9 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
14 years 2 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy
CDC
2010
IEEE
155views Control Systems» more  CDC 2010»
13 years 3 months ago
Relaxing LMI domination matricially
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
J. William Helton, Igor Klep, Scott A. McCullough
ICALP
2005
Springer
14 years 1 months ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...