9325 search results - page 260 / 1865 » The decentralized implementability problem |
124
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
160
click to vote
CLOUDCOM
2010
Springer
15 years 2 months ago
2010
Springer
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...
122
click to vote
COLCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
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...
135
click to vote
CIMCA
2005
IEEE
15 years 9 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
123
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
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...