Sciweavers

105 search results - page 9 / 21
» Balancing bike sharing systems with constraint programming
Sort
View
ICRA
2008
IEEE
129views Robotics» more  ICRA 2008»
15 years 4 months ago
Pareto optimal multi-robot coordination with acceleration constraints
— We consider a collection of robots sharing a common environment, each robot constrained to move on a roadmap in its configuration space. To program optimal collision-free moti...
Jae Bum Jung, Robert Christ
109
Voted
DAC
2007
ACM
15 years 10 months ago
Program Mapping onto Network Processors by Recursive Bipartitioning and Refining
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
Jia Yu, Jingnan Yao, Jun Yang 0002, Laxmi N. Bhuya...
ICPP
1998
IEEE
15 years 1 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
ICDCS
1991
IEEE
15 years 1 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
WMCSA
2002
IEEE
15 years 2 months ago
Extensible Adaptation via Constraint Solving
Applications running on a mobile and wireless devices must be able to adapt gracefully to limited and fluctuating network resources. The variety of applications, platforms upon w...
Yuri Dotsenko, Eyal de Lara, Dan S. Wallach, Willy...