Sciweavers

9626 search results - page 1896 / 1926
» Invariant Based Programming
Sort
View
IS
2006
13 years 9 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
ISCA
2006
IEEE
144views Hardware» more  ISCA 2006»
13 years 9 months ago
Conditional Memory Ordering
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own updates to memory available to other processors by ...
Christoph von Praun, Harold W. Cain, Jong-Deok Cho...
JAIR
2006
157views more  JAIR 2006»
13 years 9 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
JAR
2006
71views more  JAR 2006»
13 years 9 months ago
Mathematical Induction in Otter-Lambda
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...
Michael Beeson
JOT
2008
72views more  JOT 2008»
13 years 9 months ago
Fixing Apples' Broken Clipboard, with Java
The Mac OS X clipboard is infamous for changing the format of bit-mapped images that are pasted to it. These images are typically encoded using a QuickTime Tiff compressor that re...
Douglas A. Lyon
« Prev « First page 1896 / 1926 Last » Next »