Sciweavers

1176 search results - page 75 / 236
» Implicit Abstraction Heuristics
Sort
View
MST
2000
57views more  MST 2000»
13 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
CADE
2002
Springer
14 years 10 months ago
Reasoning by Symmetry and Function Ordering in Finite Model Generation
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...
Gilles Audemard, Belaid Benhamou
CCGRID
2007
IEEE
14 years 4 months ago
Exploiting Heterogeneity for Collective Data Downloading in Volunteer-based Networks
Abstract— Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fu...
Jinoh Kim, Abhishek Chandra, Jon B. Weissman
TAMC
2007
Springer
14 years 4 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
BROADNETS
2005
IEEE
14 years 3 months ago
Network design for IP-centric light trail networks
Abstract— We explore network design principles for nextgeneration all-optical wide-area networks, employing light-trail technology. Light-trail [1] is a light-wave circuit that a...
Srivatsan Balasubramanian, Ahmed E. Kamal, Arun K....