Sciweavers

2656 search results - page 351 / 532
» Design and analysis of algorithms reconsidered
Sort
View
HYBRID
1994
Springer
15 years 11 months ago
Symbolic Controller Synthesis for Discrete and Timed Systems
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...
Eugene Asarin, Oded Maler, Amir Pnueli
PPOPP
1993
ACM
15 years 11 months ago
LogP: Towards a Realistic Model of Parallel Computation
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representati...
David E. Culler, Richard M. Karp, David A. Patters...
SP
2010
IEEE
140views Security Privacy» more  SP 2010»
15 years 11 months ago
Inspector Gadget: Automated Extraction of Proprietary Gadgets from Malware Binaries
Abstract—Unfortunately, malicious software is still an unsolved problem and a major threat on the Internet. An important component in the fight against malicious software is the...
Clemens Kolbitsch, Thorsten Holz, Christopher Krue...
AIIDE
2008
15 years 9 months ago
A Cover-Based Approach to Multi-Agent Moving Target Pursuit
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
Alejandro Isaza, Jieshan Lu, Vadim Bulitko, Russel...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 9 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa