Sciweavers

503 search results - page 83 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
WABI
2010
Springer
170views Bioinformatics» more  WABI 2010»
14 years 7 months ago
Haplotypes versus Genotypes on Pedigrees
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...
Bonnie Kirkpatrick
86
Voted
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 2 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
69
Voted
HICSS
2002
IEEE
89views Biometrics» more  HICSS 2002»
15 years 2 months ago
Nash Strategies for Load Serving Entities in Dynamic Energy Multi-markets
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
Jose B. Cruz Jr., Ashkan Kian
ICC
2009
IEEE
207views Communications» more  ICC 2009»
15 years 4 months ago
Energy Efficient Collision Aware Multipath Routing for Wireless Sensor Networks
—Multipath routing can reduce the need for route updates, balance the traffic load and increase the data transfer rate in a wireless sensor network, improving the utilization of ...
Zijian Wang, Eyuphan Bulut, Boleslaw K. Szymanski
AAAI
1998
14 years 11 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...