Sciweavers

456 search results - page 90 / 92
» Extending Problem Frames to deal with stakeholder problems
Sort
View
INFFUS
2008
175views more  INFFUS 2008»
14 years 9 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
JAIR
2006
179views more  JAIR 2006»
14 years 9 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
92
Voted
SCP
2008
128views more  SCP 2008»
14 years 9 months ago
Mobile JikesRVM: A framework to support transparent Java thread migration
Today's complex applications must face the distribution of data and code among different network nodes. Computation in distributed contexts is demanding increasingly powerful...
Raffaele Quitadamo, Giacomo Cabri, Letizia Leonard...
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
14 years 9 months ago
Computational Perspectives on Map Generalization
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
Robert Weibel, Christopher B. Jones
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch