3008 search results - page 218 / 602 » Independence in connected graphs |
162
click to vote
CL
2008
Springer
15 years 6 months ago
2008
Springer
Component-orientedprogramming(COP)isactuallyakeyresearchtrackinsoftwareengineering.Avarietyofcomponent-oriented s (COLs) have been proposed with new or adapted abstractions and me...
191
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We prove a quantitative connection between the expected sum of rewards of a policy and binary classification performance on created subproblems. This connection holds without any ...
139
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Accurate analysis and simulation in multi-hop (sensor, ad hoc, and mesh) networks requires accurate representation of physical layer fading processes. Current models either ignore...
152
click to vote
EPEW
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we experimentally investigate if optimal retry times can be determined based on models that assume independence of successive tries. We do this using data obtained fo...
191
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
- Partitionability allows the creation of many physically independent subsystems, each of which retains an identical functionality as its parent network and has no communication in...