1254 search results - page 100 / 251 » Making Hard Problems Harder |
KDD
2008
ACM
14 years 10 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Flow control, including congestion control for data transmission, and rate control for multimedia streaming, is an important issue in information transmission in both wireline ...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...