Sciweavers

774 search results - page 73 / 155
» Process Discovery Using Integer Linear Programming
Sort
View
DAC
2003
ACM
16 years 3 months ago
Accurate timing analysis by modeling caches, speculation and their interaction
Schedulability analysis of real-time embedded systems requires worst case timing guarantees of embedded software performance. This involves not only language level program analysi...
Xianfeng Li, Tulika Mitra, Abhik Roychoudhury
PLDI
2010
ACM
15 years 11 months ago
Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
MP
1998
109views more  MP 1998»
15 years 1 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
15 years 7 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
94
Voted
ASPDAC
2004
ACM
87views Hardware» more  ASPDAC 2004»
15 years 7 months ago
ShatterPB: symmetry-breaking for pseudo-Boolean formulas
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...