Sciweavers

4791 search results - page 618 / 959
» Clustering with partial information
Sort
View
256
Voted
ICDCS
1996
IEEE
15 years 11 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
POS
1994
Springer
15 years 11 months ago
Changing Persistent Applications
During the lifetime of an application, the objects and bindings in a persistent store may require modification in order to fix bugs or incorporate changes. Two mechanisms, Octopus...
Alex Farkas, Alan Dearle
AINA
2007
IEEE
15 years 11 months ago
Domain Modelling for Ubiquitous Computing Applications
Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely ...
Anthony Harrington, Vinny Cahill
EUROSYS
2007
ACM
15 years 11 months ago
Discrete control for safe execution of IT automation workflows
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...
Yin Wang, Terence Kelly, Stéphane Lafortune
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
15 years 11 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes