Sciweavers

578 search results - page 45 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
14 years 2 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 8 months ago
The Tractability of Model-Checking for LTL: The Good, the Bad, and the Ugly Fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
LPNMR
2005
Springer
14 years 2 months ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
COCOON
2003
Springer
14 years 2 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
ISSS
1996
IEEE
169views Hardware» more  ISSS 1996»
14 years 29 days ago
The Use of a Virtual Instruction Set for the Software Synthesis of HW/SW Embedded Systems
The application range of the embedded computing is going to cover the majority of the market products spanning from consumer electronic, automotive, telecom and process control. F...
Alessandro Balboni, William Fornaciari, M. Vincenz...