Sciweavers

2693 search results - page 275 / 539
» French Order Without Order
Sort
View
COCOA
2009
Springer
16 years 1 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...
DILS
2009
Springer
16 years 1 months ago
Integration of Full-Coverage Probabilistic Functional Networks with Relevance to Specific Biological Processes
Probabilistic functional integrated networks are powerful tools with which to draw inferences from high-throughput data. However, network analyses are generally not tailored to spe...
Katherine James, Anil Wipat, Jennifer Hallinan
169
Voted
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
16 years 1 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
ESWS
2009
Springer
16 years 1 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICCS
2009
Springer
16 years 1 months ago
On the Origin of Grid Species: The Living Application
We present the living application, a method to autonomously manage applications on the grid. During its execution on the grid, the living application makes choices on the resources...
Derek Groen, Stefan Harfst, Simon Portegies Zwart