Sciweavers

844 search results - page 69 / 169
» Solving the p
Sort
View
WLP
2007
Springer
15 years 3 months ago
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
Martin Gebser, Jörg Pührer, Torsten Scha...
POPL
2010
ACM
15 years 4 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
MTA
2002
83views more  MTA 2002»
14 years 9 months ago
A Model for Availability of Quality of Service in Distributed Multimedia Systems
In this paper we introduce a new model for the definition and the implementation of quality of service (QoS) in distributed multimedia systems. The model provides both the users an...
Athanasios G. Malamos, Elias N. Malamas, Theodora ...
CORR
2002
Springer
111views Education» more  CORR 2002»
14 years 9 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 3 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky