Sciweavers

481 search results - page 79 / 97
» Executing Higher Order Logic
Sort
View
VLDB
2007
ACM
128views Database» more  VLDB 2007»
15 years 10 months ago
A genetic approach for random testing of database systems
Testing a database engine has been and continues to be a challenging task. The space of possible SQL queries along with their possible access paths is practically unbounded. Moreo...
Hardik Bati, Leo Giakoumakis, Steve Herbert, Aleks...
148
Voted
SAC
2004
ACM
15 years 9 months ago
A declarative framework for adaptable applications in heterogeneous environments
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...
Paola Inverardi, Fabio Mancinelli, Monica Nesi
JSAC
2006
157views more  JSAC 2006»
15 years 4 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
SYNTHESE
2010
99views more  SYNTHESE 2010»
15 years 2 months ago
Vagueness, uncertainty and degrees of clarity
The focus of the paper is on the logic of clarity and the problem of higherorder vagueness. We first examine the consequences of the notion of intransitivity of indiscriminabilit...
Paul Égré, Denis Bonnay
CODES
2006
IEEE
15 years 10 months ago
Multi-processor system design with ESPAM
For modern embedded systems, the complexity of embedded applications has reached a point where the performance requirements of these applications can no longer be supported by emb...
Hristo Nikolov, Todor Stefanov, Ed F. Deprettere