Sciweavers

6881 search results - page 1278 / 1377
» Motivation
Sort
View
ADHOC
2006
97views more  ADHOC 2006»
15 years 6 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
EJC
2008
15 years 6 months ago
Fractional coloring and the odd Hadwiger's conjecture
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
Ken-ichi Kawarabayashi, Bruce A. Reed
AMAI
2006
Springer
15 years 6 months ago
An algebraic framework for temporal attribute characteristics
Most real-world database applications manage temporal data, i.e., data with associated time references that capture a temporal aspect of the data, typically either when the data i...
Michael H. Böhlen, Johann Gamper, Christian S...
ENTCS
2008
73views more  ENTCS 2008»
15 years 6 months ago
Oracle-Based Partial Evaluation
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
Claudio Ochoa, Germán Puebla
EOR
2008
106views more  EOR 2008»
15 years 6 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
« Prev « First page 1278 / 1377 Last » Next »