Sciweavers

5889 search results - page 985 / 1178
» Graph Layout Problems
Sort
View
PODC
2010
ACM
15 years 6 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
CODES
2001
IEEE
15 years 6 months ago
Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
Neal K. Bambha, Shuvra S. Bhattacharyya, Jürg...
116
Voted
AAAI
2008
15 years 4 months ago
CIGAR: Concurrent and Interleaving Goal and Activity Recognition
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
Derek Hao Hu, Qiang Yang
119
Voted
AAAI
2010
15 years 4 months ago
Informed Lifting for Message-Passing
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...
Kristian Kersting, Youssef El Massaoudi, Fabian Ha...
AIPS
2004
15 years 4 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal