Sciweavers

861 search results - page 155 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
13 years 11 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
SE
2010
13 years 9 months ago
Automated Benchmarking of Java APIs
: Performance is an extra-functional property of software systems which is often critical for achieving sufficient scalability or efficient resource utilisation. As many applicatio...
Michael Kuperberg, Fouad Omri, Ralf Reussner
BMCBI
2010
123views more  BMCBI 2010»
13 years 7 months ago
Computationally efficient flux variability analysis
Background: Flux variability analysis is often used to determine robustness of metabolic models in various simulation conditions. However, its use has been somehow limited by the ...
Steinn Gudmundsson, Ines Thiele
EAAI
2006
123views more  EAAI 2006»
13 years 7 months ago
Applications of artificial intelligence for optimization of compressor scheduling
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
Hanh H. Nguyen, Christine W. Chan
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
A Generic Deployment Framework for Grid Computing and Distributed Applications
Deployment of distributed applications on large systems, and especially on grid infrastructures, becomes a more and more complex task. Grid users spend a lot of time to prepare, in...
Areski Flissi, Philippe Merle