Sciweavers

10392 search results - page 1796 / 2079
» Introduction to Computer Science
Sort
View
MFCS
2004
Springer
15 years 12 months ago
The Price of Anarchy for Polynomial Social Cost
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...
Martin Gairing, Thomas Lücking, Marios Mavron...
MFCS
2004
Springer
15 years 12 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
MFCS
2004
Springer
15 years 12 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
OOPSLA
2004
Springer
15 years 12 months ago
Notes on notes on postmodern programming: radio edit
These notes have the status of letters written to ourselves: we wrote them down because, without doing so, we found ourselves making rguments over and over again. So began the abs...
James Noble, Robert Biddle
WEBI
2004
Springer
15 years 12 months ago
An Integrated Approach to Discovery in Complex Information Spaces
As the amount of available data continues to increase, more and more effective means for discovering important patterns and relationships within that data are required. Although t...
Daryl H. Hepting, Cory J. Butz
« Prev « First page 1796 / 2079 Last » Next »