356 search results - page 34 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
ATAL
2006
Springer
14 years 14 days ago
2006
Springer
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
SEKE
2010
Springer
13 years 7 months ago
2010
Springer
Given the bytecode of a software system, is it possible to automatically generate attack signatures that reveal its vulnerabilities? A natural solution would be symbolically execu...
IJCGA
2000
13 years 8 months ago
2000
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
ISSS
1997
IEEE
14 years 28 days ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...
IEEEPACT
1998
IEEE
14 years 29 days ago
1998
IEEE
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...