Sciweavers

4377 search results - page 574 / 876
» Mass problems and randomness
Sort
View
DCOSS
2005
Springer
16 years 8 days ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
16 years 7 days ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
ECAI
2004
Springer
16 years 3 days ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...
ESWS
2004
Springer
16 years 3 days ago
Directory Services for Incremental Service Integration
Abstract. In an open environment populated by heterogeneous information services integration will be a major challenge. Even if the problem is similar to planning in some aspects, ...
Ion Constantinescu, Walter Binder, Boi Faltings
LATIN
2004
Springer
16 years 2 days ago
On the (Im)possibility of Non-interactive Correlation Distillation
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
Ke Yang