Sciweavers

548 search results - page 97 / 110
» Global value numbering using random interpretation
Sort
View
ATAL
2008
Springer
13 years 11 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
MOBICOM
2004
ACM
14 years 3 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
BMCBI
2006
160views more  BMCBI 2006»
13 years 10 months ago
MIMAS: an innovative tool for network-based high density oligonucleotide microarray data management and annotation
Background: The high-density oligonucleotide microarray (GeneChip) is an important tool for molecular biological research aiming at large-scale detection of small nucleotide polym...
Leandro Hermida, Olivier Schaad, Philippe Demougin...
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 9 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 9 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson