Sciweavers

1512 search results - page 49 / 303
» connection 2006
Sort
View
CN
2006
111views more  CN 2006»
14 years 9 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
JCT
2006
102views more  JCT 2006»
14 years 9 months ago
Minimal bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
Serguei Norine, Robin Thomas
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
14 years 9 months ago
Identifying Codes with Small Radius in Some Infinite Regular Graphs
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
Irène Charon, Olivier Hudry, Antoine Lobste...
JOCN
2010
68views more  JOCN 2010»
14 years 8 months ago
Shared Neural Circuits for Mentalizing about the Self and Others
■ Although many examples exist for shared neural representations of self and other, it is unknown how such shared representations interact with the rest of the brain. Furthermor...
Michael V. Lombardo, Bhismadev Chakrabarti, Edward...
CL
2006
Springer
14 years 9 months ago
Inter-language reflection: A conceptual model and its implementation
Meta programming is the act of reasoning about a computational system. For example, a program in Prolog can reason about a program written in Smalltalk. Reflection is a more power...
Kris Gybels, Roel Wuyts, Stéphane Ducasse, ...