Sciweavers

16404 search results - page 35 / 3281
» A set coverage problem
Sort
View
108
Voted
JUCS
2010
133views more  JUCS 2010»
14 years 7 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica
WWW
2001
ACM
16 years 1 months ago
Efficient Acquisition of Web Data through Restricted Query Interfaces
A wealth of information is available on the Web. But often, such data are hidden behind form interfaces which allow only a restrictive set of queries over the underlying databases...
Cláudio T. Silva, Juliana Freire, Simon Bye...
VLSID
2005
IEEE
127views VLSI» more  VLSID 2005»
15 years 6 months ago
Formal Methods for Analyzing the Completeness of an Assertion Suite against a High-Level Fault Model
One of the emerging challenges in formal property verification (FPV) technology is the problem of deciding whether sufficient properties have been written to cover the design in...
Sayantan Das, Ansuman Banerjee, Prasenjit Basu, Pa...
JUCS
2008
150views more  JUCS 2008»
15 years 14 days ago
Optimal Sensor Network Layout Using Multi-Objective Metaheuristics
: Wireless Sensor Networks (WSN) allow, thanks to the use of small wireless devices known as sensor nodes, the monitorization of wide and remote areas with precision and liveness u...
Guillermo Molina, Enrique Alba, El-Ghazali Talbi
115
Voted
IOR
2008
148views more  IOR 2008»
15 years 15 days ago
A Game-Theoretic Approach to Efficient Power Management in Sensor Networks
Wireless sensor networks pose numerous fundamental coordination problems. For instance, in a number of application domains including homeland security, environmental monitoring an...
Enrique Campos-Náñez, Alfredo Garcia...