Sciweavers

49 search results - page 9 / 10
» Reactive Pedestrian Path Following from Examples
Sort
View
EMSOFT
2003
Springer
13 years 11 months ago
Resource Interfaces
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
Arindam Chakrabarti, Luca de Alfaro, Thomas A. Hen...
ICRA
2010
IEEE
114views Robotics» more  ICRA 2010»
13 years 4 months ago
A general information quality based approach for satisfying sensor constraints in multirobot tasks
— Many architectures have been proposed to solve tightly-coupled multirobot tasks (MT) through coalitions of heterogeneous robots. However, several issues remain unaddressed. As ...
Yu Zhang, Lynne E. Parker
EJC
2010
13 years 1 months ago
Modelling a Query Space Using Associations
We all use our associative memory constantly. Words and concepts form paths that we can follow to find new related concepts; for example, when we think about a car we may associate...
Mika Timonen, Paula Silvonen, Melissa Kasari
MOBICOM
2004
ACM
13 years 11 months ago
End-to-end performance and fairness in multihop wireless backhaul networks
Wireless IEEE 802.11 networks in residences, small businesses, and public “hot spots” typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest ...
Violeta Gambiroza, Bahareh Sadeghi, Edward W. Knig...
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
11 years 8 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx