526 search results - page 98 / 106 » Improved Decomposition of STGs |
136
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
152
click to vote
IEEEPACT
2005
IEEE
15 years 10 months ago
2005
IEEE
Hiding communication latency is an important optimization for parallel programs. Programmers or compilers achieve this by using non-blocking communication primitives and overlappi...
136
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
167
Voted
UML
2005
Springer
15 years 10 months ago
2005
Springer
We present in this paper a rigorous and automated based approach for the behavioral validation of control software systems. This approach relies on metamodeling, model-transformati...
150
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
The use of information technologies (IT) to collect personal health information is growing in popularity via computer-assisted interviewing and a wide variety of healthcare Web si...