Sciweavers

544 search results - page 69 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
CEC
2007
IEEE
13 years 12 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
ICALP
2004
Springer
14 years 1 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
AMAI
2004
Springer
14 years 1 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
CVPR
2012
IEEE
11 years 10 months ago
Real-time scene text localization and recognition
An end-to-end real-time scene text localization and recognition method is presented. The real-time performance is achieved by posing the character detection problem as an efficie...
Lukas Neumann, Jiri Matas
JSAC
2007
59views more  JSAC 2007»
13 years 7 months ago
On scheduling of peer-to-peer video services
Abstract— Peer-to-peer (P2P) video systems provide a costeffective way for a large number of hosts to colloaborate for video sharing. Two features characterize such a system: 1) ...
Ying Cai, Ashwin Natarajan, Johnny Wong