Sciweavers

986 search results - page 94 / 198
» Generalized Goal Programming: polynomial methods and applica...
Sort
View
MFCS
2005
Springer
14 years 2 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
LPNMR
2009
Springer
14 years 1 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
SAC
2009
ACM
14 years 4 months ago
Variable handling in time-based XML declarative languages
This paper focuses on time-based declarative languages. The use of declarative languages has the advantage of their simplicity and gh-level abstraction, usually requiring few or n...
Luiz Fernando Gomes Soares, Rogério Ferreir...
SIGSOFT
2009
ACM
14 years 10 months ago
Asserting and checking determinism for multithreaded programs
The trend towards processors with more and more parallel cores is increasing the need for software that can take advantage of parallelism. The most widespread method for writing p...
Jacob Burnim, Koushik Sen
HIM
1997
Springer
144views Multimedia» more  HIM 1997»
14 years 1 months ago
DIANE - Hypermedia Documents in a Distributed Annotation Environment
The project DIANE is an EU-funded project in the ACTS Program and started in September 1995. The goal of DIANE is to establish a service, which enables an user to annotate anythin...
Hartmut Benz, Steffen Fischer, Rolf Mecklenburg, G...