Sciweavers

2107 search results - page 421 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 5 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
HEURISTICS
2010
13 years 18 days ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
TASLP
2010
167views more  TASLP 2010»
13 years 14 days ago
Broadband Source Localization From an Eigenanalysis Perspective
Abstract--Broadband source localization has several applications ranging from automatic video camera steering to target signal tracking and enhancement through beamforming. Consequ...
Mehrez Souden, Jacob Benesty, Sofiène Affes
NAR
2011
253views Computer Vision» more  NAR 2011»
12 years 8 months ago
tRNADB-CE 2011: tRNA gene database curated manually by experts
We updated the tRNADB-CE by analyzing 939 complete and 1301 draft genomes of prokaryotes and eukaryotes, 171 complete virus genomes, 121 complete chloroplast genomes and approxima...
Takashi Abe, Toshimichi Ikemura, Junichi Sugahara,...
POPL
2011
ACM
12 years 8 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...