Sciweavers

1828 search results - page 202 / 366
» First-Class Type Classes
Sort
View
QEST
2009
IEEE
16 years 1 months ago
Exploiting Restricted Transitions in Quasi-Birth-and-Death Processes
—In this paper we consider Quasi-Birth-and-Death (QBD) processes where the upward (resp. downward) transitions are restricted to occur only from (resp. to) a subset of the phase ...
Juan F. Pérez, Benny Van Houdt
WOLLIC
2009
Springer
16 years 1 months ago
Spoilt for Choice: Full First-Order Hierarchical Decompositions
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
Sebastian Link
ESWS
2009
Springer
16 years 1 months ago
Ontology-Based Service Discovery Front-End Interface for GloServ
This paper describes an ontology-based service discovery front-end interface for GloServ. GloServ is a service discovery engine, which is an ontologybased distributed service disco...
Knarig Arabshian, Christian Dickmann, Henning Schu...
ICCBR
2009
Springer
16 years 29 days ago
Adaptation versus Retrieval Trade-Off Revisited: An Analysis of Boundary Conditions
In this paper we revisit the trade-off between adaptation and retrieval effort traditionally held as a principle in case-based reasoning. This principle states that the time needed...
Stephen Lee-Urban, Héctor Muñoz-Avil...
SARA
2009
Springer
16 years 29 days ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...