Sciweavers

2294 search results - page 180 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
ASIAMS
2007
IEEE
15 years 4 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
WCET
2008
14 years 11 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
JCT
2007
90views more  JCT 2007»
14 years 10 months ago
Elliptic enumeration of nonintersecting lattice paths
We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. ...
Michael Schlosser
INFOCOM
2008
IEEE
15 years 4 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
TABLETOP
2007
IEEE
15 years 4 months ago
Improving Menu Interaction for Cluttered Tabletop Setups with User-Drawn Path Menus
Many digital tabletop systems have a graphical user interface (GUI) that features context (or pop-up) menus. While linear and pie menus are commonly used for direct pen and touch ...
Daniel Leithinger, Michael Haller