Sciweavers

5019 search results - page 975 / 1004
» On the Reflexivity of Point Sets
Sort
View
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 9 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
WCE
2007
13 years 9 months ago
Dynamic Traffic Regulation for WiFi Networks
— Multimedia applications require high bandwidth in order to assure certain level of Quality of Service (QoS). It is well known that the characteristics of the traffic for multim...
Domingo Marrero Marrero, Elsa María Mac&iac...
ATAL
2010
Springer
13 years 9 months ago
A distributed algorithm for anytime coalition structure generation
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
Tomasz P. Michalak, Jacek Sroka, Talal Rahwan, Mic...
ATAL
2010
Springer
13 years 9 months ago
Linear options
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
Jonathan Sorg, Satinder P. Singh
ECAI
2010
Springer
13 years 9 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...