Sciweavers

4488 search results - page 83 / 898
» Properties of NP-Complete Sets
Sort
View
DEDS
2002
86views more  DEDS 2002»
13 years 7 months ago
On an Optimization Problem in Sensor Selection*
We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cos...
Rami Debouk, Stéphane Lafortune, Demostheni...
ISPAN
2002
IEEE
14 years 28 days ago
On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in...
Jie Wu, Fei Dai
SIAMDM
2011
13 years 3 months ago
On Maximal S-Free Convex Sets
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
Diego A. Morán R., Santanu S. Dey
ICRA
2009
IEEE
81views Robotics» more  ICRA 2009»
14 years 2 months ago
Representing sets of orientations as convex cones
— In a wide range of applications the orientation of a rigid body does not need to be restricted to one given orientation, but can be given as a continuous set of frames. We addr...
Pål Johan From, Jan Tommy Gravdahl
COCOON
2009
Springer
14 years 2 months ago
On Finding Small 2-Generating Sets
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
Isabelle Fagnot, Guillaume Fertin, Stéphane...