Sciweavers

27354 search results - page 5397 / 5471
» Distributed And Parallel Computing
Sort
View
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 1 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
ATAL
2006
Springer
15 years 1 months ago
Deploying a personalized time management agent
We report on our ongoing practical experience in designing, implementing, and deploying PTIME, a personalized agent for time management and meeting scheduling in an open, multi-ag...
Pauline Berry, Bart Peintner, Ken Conley, Melinda ...
ATAL
2006
Springer
15 years 1 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
ATAL
2006
Springer
15 years 1 months ago
A utility-based sensing and communication model for a glacial sensor network
This paper reports on the development of a utility-based mechanism for managing sensing and communication in cooperative multi-sensor networks. The specific application considered...
Paritosh Padhy, Rajdeep K. Dash, Kirk Martinez, Ni...
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
15 years 1 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
« Prev « First page 5397 / 5471 Last » Next »