Sciweavers

7456 search results - page 1305 / 1492
» Parallelism in Logic Programming
Sort
View
144
Voted
ANCS
2007
ACM
15 years 7 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
128
Voted
ISSAC
1995
Springer
155views Mathematics» more  ISSAC 1995»
15 years 7 months ago
On the Implementation of Dynamic Evaluation
Dynamic evaluation is a technique for producing multiple results according to a decision tree which evolves with program execution. Sometimes it is desired to produce results for ...
Peter A. Broadbery, T. Gómez-Díaz, S...
136
Voted
WOTUG
2008
15 years 5 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
15 years 3 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
BMCBI
2007
152views more  BMCBI 2007»
15 years 3 months ago
Recodon: Coalescent simulation of coding DNA sequences with recombination, migration and demography
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...
Miguel Arenas, David Posada
« Prev « First page 1305 / 1492 Last » Next »