Sciweavers

464 search results - page 73 / 93
» Improved Fixed-Parameter Algorithms for Two Feedback Set Pro...
Sort
View
NETWORKING
2010
13 years 10 months ago
Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding
Embedding of virtual network (VN) requests on top of a shared physical network poses an intriguing combination of theoretical and practical challenges. Two major problems with the ...
Nabeel Farooq Butt, N. M. Mosharaf Kabir Chowdhury...
COR
2008
99views more  COR 2008»
13 years 8 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 8 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
JCP
2008
103views more  JCP 2008»
13 years 8 months ago
Weighted Clustering and Evolutionary Analysis of Hybrid Attributes Data Streams
It presents some definitions of projected cluster and projected cluster group on hybrid attributes after having given some definitions on ordered attributes and sorted attributes t...
Xinquan Chen
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...