804 search results - page 86 / 161 » On the Termination of the Chase Algorithm |
100
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
124
click to vote
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper introduces an algorithm to approximately find optimal wireless networks in presence of fading. Joint optimization of application level rates, routes, link capacities, ...
106
Voted
CVPR
2008
IEEE
15 years 7 months ago
2008
IEEE
We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a-posteriori (MAP) data association problem is mapped in...
98
Voted
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
— In high density (HD) WLANs, packet losses can occur due to hidden terminals (asynchronous interference) or collisions (synchronous interference). Without differentiating above ...
101
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...