Sciweavers

2976 search results - page 292 / 596
» On the bounded integer programming
Sort
View
TPDS
1998
110views more  TPDS 1998»
15 years 4 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 8 months ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
POPL
2010
ACM
16 years 2 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
DATE
2008
IEEE
122views Hardware» more  DATE 2008»
15 years 11 months ago
Simulation-Directed Invariant Mining for Software Verification
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
Xueqi Cheng, Michael S. Hsiao
SPAA
2006
ACM
15 years 11 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...