Sciweavers

1594 search results - page 297 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
GLOBECOM
2009
IEEE
15 years 6 months ago
Hierarchical Network Formation Games in the Uplink of Multi-Hop Wireless Networks
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...
Walid Saad, Quanyan Zhu, Tamer Basar, Zhu Han, Are...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 5 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
MOBICOM
2006
ACM
15 years 5 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
15 years 5 months ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 4 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz