Sciweavers

146 search results - page 29 / 30
» An Algorithm for Enumerating All Spanning Trees of a Directe...
Sort
View
WOSP
1998
ACM
13 years 10 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
IEEESCC
2009
IEEE
13 years 3 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
IJCAI
2003
13 years 7 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
IWCMC
2006
ACM
13 years 11 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
WCRE
2003
IEEE
13 years 11 months ago
GUI Ripping: Reverse Engineering of Graphical User Interfaces for Testing
Graphical user interfaces (GUIs) are important parts of today’s software and their correct execution is required to ensure the correctness of the overall software. A popular tec...
Atif M. Memon, Ishan Banerjee, Adithya Nagarajan