Sciweavers

11381 search results - page 313 / 2277
» Connectivity
Sort
View
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 6 months ago
Removing Local Extrema from Imprecise Terrains
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...
Chris Gray, Frank Kammer, Maarten Löffler, Ro...
DISOPT
2008
107views more  DISOPT 2008»
15 years 6 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
DM
2008
69views more  DM 2008»
15 years 6 months ago
Connectedness of the graph of vertex-colourings
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
CN
2006
111views more  CN 2006»
15 years 6 months ago
Analytical modeling of CAC in next generation wireless systems
Though Connection Admission Control (CAC) in wireless networks has been studied extensively, the heterogeneous structure of Next Generation Wireless Systems (NGWS) makes CAC very ...
Tuna Tugcu, H. Birkan Yilmaz, Feodor S. Vainstein
CONNECTION
2006
91views more  CONNECTION 2006»
15 years 6 months ago
From unknown sensors and actuators to actions grounded in sensorimotor perceptions
This article describes a developmental system based on information theory implemented on a real robot that learns a model of its own sensory and actuator apparatus. There is no in...
Lars Olsson, Chrystopher L. Nehaniv, Daniel Polani