Sciweavers

388 search results - page 40 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
ASPDAC
2009
ACM
113views Hardware» more  ASPDAC 2009»
15 years 3 months ago
Post-routing redundant via insertion with wire spreading capability
—Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transforme...
Cheok-Kei Lei, Po-Yi Chiang, Yu-Min Lee
MICAI
2007
Springer
15 years 6 months ago
Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling
This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered appl...
Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz ...
ICML
2008
IEEE
16 years 18 days ago
Apprenticeship learning using linear programming
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
Umar Syed, Michael H. Bowling, Robert E. Schapire
DAC
2003
ACM
15 years 5 months ago
Symbolic analysis of analog circuits with hard nonlinearity
A new methodology is presented to solve a strongly nonlinear circuit, characterized by Piece-Wise Linear (PWL) functions, symbolically and explicitly in terms of its circuit param...
Alicia Manthe, Zhao Li, C.-J. Richard Shi
ATMOS
2007
163views Optimization» more  ATMOS 2007»
15 years 1 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer