Sciweavers

19700 search results - page 3845 / 3940
» DNA-Based Computation Times
Sort
View
AFP
2004
Springer
105views Formal Methods» more  AFP 2004»
14 years 2 months ago
Epigram: Practical Programming with Dependent Types
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
Conor McBride
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
14 years 2 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
CAISE
2004
Springer
14 years 2 months ago
Network-based Business Process Management: a Discussion on Embedding Business Logic in Communications Networks
Advanced Business Process Management (BPM) tools enable the decomposition of previously integrated and often ill-defined processes into reusable process modules. These process modu...
Louis-François Pau, Peter H. M. Vervest
CCS
2004
ACM
14 years 2 months ago
Attestation-based policy enforcement for remote access
Intranet access has become an essential function for corporate users. At the same time, corporation’s security administrators have little ability to control access to corporate ...
Reiner Sailer, Trent Jaeger, Xiaolan Zhang, Leende...
CP
2004
Springer
14 years 2 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
« Prev « First page 3845 / 3940 Last » Next »