Sciweavers

1727 search results - page 62 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
JDA
2006
184views more  JDA 2006»
15 years 6 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
SMA
2003
ACM
173views Solid Modeling» more  SMA 2003»
15 years 11 months ago
Automating the CAD/CAE dimensional reduction process
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
Krishnan Suresh
KBSE
2005
IEEE
15 years 11 months ago
Automated replay and failure detection for web applications
User-session-based testing of web applications gathers user sessions to create and continually update test suites based on real user input in the field. To support this approach ...
Sara Sprenkle, Emily Gibson, Sreedevi Sampath, Lor...
ANSS
2001
IEEE
15 years 9 months ago
New Queuing Strategy for Large Scale ATM Switches
In this work, we study the different buffering techniques used in the literature to solve the contention problem in A TM switching architectures. The objective of our study is to ...
Mohsen Guizani, Ala I. Al-Fuqaha
GECCO
2008
Springer
116views Optimization» more  GECCO 2008»
15 years 7 months ago
Multi-objective memetic approach for flexible process sequencing problems
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...
Jian-Hong Chen, Jian-Hung Chen