4539 search results - page 843 / 908 » Approaches to Compute Workflow Complexity |
CAV
2009
Springer
15 years 10 months ago
2009
Springer
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract. Denial-of-Service (DoS) attacks remain a challenging problem in the Internet. In a DoS attack the attacker is attempting to make a resource unavailable to its intended le...
CODES
2006
IEEE
15 years 3 months ago
2006
IEEE
Designer productivity and design predictability are vital factors for successful embedded system design. Shrinking time-to-market and increasing complexity of these systems requir...
SYNASC
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...