Sciweavers

697 search results - page 99 / 140
» On the Theory of Average Case Complexity
Sort
View
WSC
1997
13 years 9 months ago
Selective Rerouting Using Simulated Steady State System Data
Effective operational control of a manufacturing system that has routing flexibility is dependent upon being able to make informed real-time decisions in the event of a system dis...
Catherine M. Harmonosky, Robert H. Farr, Ming-Chua...
TEC
2012
197views Formal Methods» more  TEC 2012»
11 years 10 months ago
Improving Generalization Performance in Co-Evolutionary Learning
Recently, the generalization framework in co-evolutionary learning has been theoretically formulated and demonstrated in the context of game-playing. Generalization performance of...
Siang Yew Chong, Peter Tino, Day Chyi Ku, Xin Yao
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 9 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
CASES
2008
ACM
13 years 10 months ago
Multi-granularity sampling for simulating concurrent heterogeneous applications
Detailed or cycle-accurate/bit-accurate (CABA) simulation is a critical phase in the design flow of embedded systems. However, with increasing system complexity, full detailed sim...
Melhem Tawk, Khaled Z. Ibrahim, Smaïl Niar
PODS
2010
ACM
242views Database» more  PODS 2010»
14 years 1 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak