Sciweavers

170 search results - page 19 / 34
» A Simple Greedy Algorithm for the k-Disjoint Flow Problem
Sort
View
CEC
2007
IEEE
13 years 11 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
ADHOC
2007
108views more  ADHOC 2007»
13 years 7 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici
FOCS
2007
IEEE
14 years 1 months ago
Approximation Algorithms for Partial-Information Based Stochastic Control with Markovian Rewards
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
Sudipto Guha, Kamesh Munagala
JSS
2007
120views more  JSS 2007»
13 years 7 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
ISCC
2003
IEEE
14 years 25 days ago
Controlling Bursts in Best-effort Routers for Flow Isolation
In today’s Internet a user can be adversely affected by other users that overload the router. To address this problem, routers need to provide flow isolation. In this paper, we...
Miguel A. Ruiz-Sánchez, Walid Dabbous