Sciweavers

7228 search results - page 1229 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
130
Voted
PASTE
2010
ACM
15 years 5 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
123
Voted
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 4 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
134
Voted
GECCO
2008
Springer
114views Optimization» more  GECCO 2008»
15 years 4 months ago
Strategic positioning in tactical scenario planning
Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for op...
James M. Whitacre, Hussein A. Abbass, Ruhul A. Sar...
129
Voted
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 3 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
136
Voted
FOCS
2008
IEEE
15 years 3 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
« Prev « First page 1229 / 1446 Last » Next »