Sciweavers

1184 search results - page 188 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
INFOCOM
2006
IEEE
15 years 8 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 10 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
WWW
2005
ACM
16 years 2 months ago
MemoSpace: a visualization tool for web navigation
A central aspect of reducing orientation problems in web navigation concerns the design of adequate navigation aids. Visualization of users' navigation path in form of a temp...
Jacqueline Waniek, Holger Langner, Falk Schmidsber...
IPPS
2009
IEEE
15 years 8 months ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
AUTOMATICA
2008
134views more  AUTOMATICA 2008»
15 years 2 months ago
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...