1927 search results - page 363 / 386 » UMDAs for dynamic optimization problems |
121
Voted
ICCAD
2007
IEEE
15 years 9 months ago
2007
IEEE
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
124
Voted
WWW
2010
ACM
15 years 7 months ago
2010
ACM
Web service composition enables seamless and dynamic integration of business applications on the web. The performance of the composed application is determined by the performance ...
112
Voted
CCO
2001
Springer
15 years 5 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
117
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
129
Voted
BIOCOMP
2008
15 years 1 months ago
2008
Background: Inferring a gene regulatory network (GRN) from high throughput biological data is often an under-determined problem and is a challenging task due to the following reas...