Sciweavers

18306 search results - page 13 / 3662
» Algorithmics in Exponential Time
Sort
View
ICALP
2004
Springer
14 years 1 months ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl
COCO
2006
Springer
97views Algorithms» more  COCO 2006»
13 years 11 months ago
A Duality between Clause Width and Clause Density for SAT
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
Chris Calabro, Russell Impagliazzo, Ramamohan Patu...
MMB
2004
Springer
102views Communications» more  MMB 2004»
14 years 1 months ago
Improving the Timeliness of Rate Measurements
Rate measurements are required for many purposes, e.g. for system analysis and modelling or for live systems that react to measurements. For off-line measurement all data is avail...
Rüdiger Martin, Michael Menth
ACL
1990
13 years 8 months ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
Sandiway Fong
ASP
2005
Springer
14 years 1 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi