Sciweavers

3320 search results - page 154 / 664
» Heuristics for the Phylogeny Problem
Sort
View
WCNC
2008
IEEE
16 years 29 days ago
A Resource Allocation Scheme for TH-UWB Networks with Multiple Sinks
Abstract—In this work, we study the time-slot allocation problem in a multi-sink single-hop TH-UWB network scenario, where the traffic from a sensor node is anycasted via a sing...
Hwee-Xian Tan, Mun-Choon Chan, Peng Yong Kong, Che...
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
16 years 17 days ago
Post-routing redundant via insertion for yield/reliability improvement
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
Kuang-Yao Lee, Ting-Chi Wang
WINE
2005
Springer
139views Economy» more  WINE 2005»
16 years 1 days ago
Price of Anarchy, Locality Gap, and a Network Service Provider Game
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, V...
AAAI
1998
15 years 8 months ago
A Feature-Based Learning Method for Theorem Proving
Automatedreasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have manyshortcomings. The...
Matthias Fuchs
COCOON
2007
Springer
16 years 23 days ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...