Sciweavers

4266 search results - page 285 / 854
» The container loading problem
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
16 years 4 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
WISE
2009
Springer
16 years 1 months ago
Entry Pairing in Inverted File
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a full-text IR system. The idea is to merge the entries of two frequently ...
Hoang Thanh Lam, Raffaele Perego, Nguyen Thoi Minh...
IPPS
2009
IEEE
15 years 11 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
127
Voted
CEC
2007
IEEE
15 years 11 months ago
Estimation of distribution algorithms for testing object oriented software
— One of the main tasks software testing involves is the generation of the test cases to be used during the test. Due to its expensive cost, the automation of this task has becom...
Ramón Sagarna, Andrea Arcuri, Xin Yao
KES
2007
Springer
15 years 11 months ago
Calculating Optimal Decision Using Meta-level Agents for Multi-Agents in Networks
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
Anne Håkansson, Ronald L. Hartung