Sciweavers

3221 search results - page 166 / 645
» Termination of Linear Programs
Sort
View
ICALP
2010
Springer
15 years 8 months ago
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
Mikolaj Bojanczyk, Pawel Parys
DAM
2008
84views more  DAM 2008»
15 years 6 months ago
The colourful feasibility problem
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by B
Antoine Deza, Sui Huang, Tamon Stephen, Tamá...
CISIS
2008
IEEE
16 years 24 days ago
Hardware Software Partitioning Problem in Embedded System Design Using Particle Swarm Optimization Algorithm
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
Alakananda Bhattacharya, Amit Konar, Swagatam Das,...
PLDI
2004
ACM
15 years 11 months ago
Kill-safe synchronization abstractions
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
Matthew Flatt, Robert Bruce Findler
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
15 years 4 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens