7006 search results - page 293 / 1402 » Approximation Algorithms |
136
Voted
TCS
2010
15 years 2 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
124
click to vote
ESWS
2005
Springer
15 years 9 months ago
2005
Springer
A central aspect of HCONE-merge is the mapping of ontology concepts to a hidden intermediate ontology by uncovering the intended meaning of concepts. Such a mapping is realized by ...
151
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
103
Voted
ICCBR
2009
Springer
15 years 10 months ago
2009
Springer
This paper presents a new approach for spatial event prediction that combines a value function approximation algorithm and case-based reasoning predictors. Each of these predictors...
139
click to vote
CCCG
2009
15 years 5 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...