1629 search results - page 291 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
KDD
2003
ACM
15 years 10 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
GECCO
2006
Springer
15 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...
RT
2000
Springer
15 years 1 months ago
2000
Springer
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
123
click to vote
ICDT
2010
ACM
15 years 1 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...