Sciweavers

976 search results - page 99 / 196
» The Complexity of Timetable Construction Problems
Sort
View
ICALP
2004
Springer
14 years 2 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson
TOOLS
2000
IEEE
14 years 1 months ago
A Case Study of Framework Design for Horizontal Reuse
In this experience report we present a case study in designing, implementing, and reusing an object-oriented framework for constructing and editing complex search expressions over...
Henrik Bærbak Christensen, Hebrick Rø...
CISC
2006
Springer
103views Cryptology» more  CISC 2006»
14 years 22 days ago
Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
Christophe Tartary, Huaxiong Wang
AAAI
2006
13 years 10 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
APBC
2003
13 years 10 months ago
Towards Transparent Access to Multiple Biological Databanks
Nowadays, biologists use a number of large biological databanks to find relevant information for their research. Users of these databanks face a number of problems. One problem i...
Patrick Lambrix, Vaida Jakoniene