Sciweavers

10414 search results - page 1630 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
IWCMC
2010
ACM
15 years 8 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
EMSOFT
2008
Springer
15 years 8 months ago
Portioned EDF-based scheduling on multiprocessors
This paper presents an EDF-based algorithm, called Earliest Deadline Deferrable Portion (EDDP), for efficient scheduling of recurrent real-time tasks on multiprocessor systems. Th...
Shinpei Kato, Nobuyuki Yamasaki
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
15 years 8 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
AAAI
2010
15 years 7 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
AAAI
2006
15 years 7 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
« Prev « First page 1630 / 2083 Last » Next »