Sciweavers

5981 search results - page 270 / 1197
» time 2006
Sort
View
JCM
2006
95views more  JCM 2006»
15 years 6 months ago
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
Ying Zhang, Qingfeng Huang
IJFCS
2006
132views more  IJFCS 2006»
15 years 6 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Alexander Okhotin
SIGMETRICS
2006
ACM
116views Hardware» more  SIGMETRICS 2006»
16 years 15 days ago
The Erlang model with non-poisson call arrivals
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it ...
Thomas Bonald
CP
2006
Springer
15 years 10 months ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
AMC
2006
131views more  AMC 2006»
15 years 6 months ago
How much can analog and hybrid systems be proved (super-)Turing
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...
Olivier Bournez