Sciweavers

265 search results - page 52 / 53
» Algorithms for Terminal Steiner Trees
Sort
View
CN
2007
135views more  CN 2007»
13 years 5 months ago
Handling feature interactions in the language for end system services
Since traditional telecommunication networks assume dumb terminals, there are rarely feature interactions involving end systems. However, in Internet telephony systems, such featur...
Xiaotao Wu, Henning Schulzrinne
ESWS
2009
Springer
13 years 12 months ago
Hybrid Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
Cristina Feier, Stijn Heymans
GD
2007
Springer
13 years 11 months ago
Line Crossing Minimization on Metro Maps
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
INFOCOM
2003
IEEE
13 years 10 months ago
A Novel Mechanism for Contention Resolution in HFC Networks
Abstract— The Medium Access Control (MAC) scheme proposed by DAVIC/DVB, IEEE 802.14 and DOCSIS for the upstream channel of Hybrid Fiber Coaxial (HFC) access networks is based on ...
Mark Van den Broek, Ivo J. B. F. Adan, Saishankar ...
COMPSAC
2000
IEEE
13 years 9 months ago
GAPS: A Genetic Programming System
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...
Michael D. Kramer, Du Zhang