3433 search results - page 412 / 687 » Heuristics for a bidding problem |
179
click to vote
CSB
2003
IEEE
16 years 2 days ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
160
click to vote
INFOCOM
2003
IEEE
16 years 1 days ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
171
click to vote
PDP
2003
IEEE
16 years 1 days ago
2003
IEEE
As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimi...
183
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
192
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
— Wavelength routed optical networks allow to design a logical topology, comprising lightpaths and routers, which is overlayed on the physical topology, comprising optical fiber...