Sciweavers

270 search results - page 47 / 54
» Partitioning into Sets of Bounded Cardinality
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 7 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
HYBRID
2000
Springer
13 years 11 months ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...
VRST
2003
ACM
14 years 24 days ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
GD
2004
Springer
14 years 28 days ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
CGO
2003
IEEE
14 years 25 days ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz