Sciweavers

3238 search results - page 106 / 648
» On the Computational Interpretation of Negation
Sort
View
STACS
2001
Springer
15 years 10 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
PERSUASIVE
2009
Springer
16 years 28 days ago
Designing empathic computers: the effect of multimodal empathic feedback using animated agent
Experiencing emotional distress is the number one reason why people who are undergoing behaviour modification (e.g. quitting smoking, dieting) suffer from relapses. Providing emot...
Hien Nguyen, Judith Masthoff
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
16 years 28 days ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
16 years 15 days ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
ESA
2003
Springer
141views Algorithms» more  ESA 2003»
15 years 11 months ago
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves
We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves o...
Nicola Wolpert