Sciweavers

832 search results - page 21 / 167
» Parallel algorithms for solving aggregated shortest-path pro...
Sort
View
69
Voted
DAC
2004
ACM
15 years 3 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
ORL
2010
108views more  ORL 2010»
14 years 4 months ago
Weak aggregating algorithm for the distribution-free perishable inventory problem
Abstract. We formulate the multiperiod, distribution-free perishable inventory problem as a problem of prediction with expert advice and apply an online learning method (the Weak A...
Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail ...
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
15 years 1 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
EDBTW
2006
Springer
15 years 1 months ago
Enhanced Regular Path Queries on Semistructured Databases
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
Dan C. Stefanescu, Alex Thomo
PPSN
1998
Springer
15 years 1 months ago
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...