Sciweavers

2695 search results - page 153 / 539
» The Complexity of Forecast Testing
Sort
View
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
15 years 11 months ago
Evolutionary Approaches to Linear Ordering Problem
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
Václav Snásel, Pavel Krömer, Ja...
DLOG
2006
15 years 5 months ago
PSPACE Automata for Description Logics
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
Jan Hladik, Rafael Peñaloza
CORR
2010
Springer
47views Education» more  CORR 2010»
15 years 4 months ago
Robustness and Generalization
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...
Huan Xu, Shie Mannor
FUIN
2006
111views more  FUIN 2006»
15 years 4 months ago
Typing the Behavior of Software Components using Session Types
This paper proposes the use of session types to extend with behavioural information the simple descriptions usually provided by software component interfaces. We show how session t...
Antonio Vallecillo, Vasco Thudichum Vasconcelos, A...
JUCS
2006
109views more  JUCS 2006»
15 years 4 months ago
Verifying Real-Time Properties of tccp Programs
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
María Alpuente, María-del-Mar Gallar...