Sciweavers

2850 search results - page 503 / 570
» On Timed Models and Full Abstraction
Sort
View
BIRTHDAY
2003
Springer
14 years 4 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
CP
2003
Springer
14 years 4 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
SIGMOD
2010
ACM
377views Database» more  SIGMOD 2010»
14 years 3 months ago
Online aggregation and continuous query support in MapReduce
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, the output of each MapReduce task and job is materialized to ...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
ATAL
2001
Springer
14 years 3 months ago
Ontological Overhearing
Abstract. The collaboration between two intelligent agents can be greatly enhanced if a third agent, who has some understanding of the communication between the first two, interve...
Marco Aiello, Paolo Busetta, Antonia Donà, ...
NSF
2001
Springer
225views Computer Vision» more  NSF 2001»
14 years 3 months ago
Content-Based Networking: A New Communication Infrastructure
Abstract. We argue that the needs of many classes of modern applications, especially those targeted at mobile or wireless computing, demand the services of content-based publish/su...
Antonio Carzaniga, Alexander L. Wolf