Sciweavers

10718 search results - page 396 / 2144
» On the Circuit Implementation Problem
Sort
View
209
Voted
CLOUDCOM
2010
Springer
15 years 4 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin
COLCOM
2008
IEEE
16 years 1 months ago
The Data Interoperability Problem as an Exemplary Case Study in the Development of Software Collaboration Environments
The Data Interoperability Problem appears in contexts where consumers need to peruse data owned by producers, and the syntax and/or semantics of such data—at both end points—ar...
Arturo J. Sánchez-Ruíz, Karthikeyan ...
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
16 years 7 days ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
183
Voted
ICNP
2002
IEEE
15 years 11 months ago
Analysis of the MED Oscillation Problem in BGP
The Multi Exit Discriminator (MED) attribute of the Border Gateway Protocol (BGP) is widely used to implement “cold potato routing” between autonomous systems. However, the us...
Timothy Griffin, Gordon T. Wilfong
CPAIOR
2010
Springer
15 years 11 months ago
Constraint-Based Local Search for Constrained Optimum Paths Problems
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
Pham Quang Dung, Yves Deville, Pascal Van Hentenry...