Sciweavers

364 search results - page 52 / 73
» Generalized normal forms and polynomial system solving
Sort
View
78
Voted
WCW
2004
Springer
15 years 3 months ago
Overhaul: Extending HTTP to Combat Flash Crowds
The increasing use of the web for serving http content, for database transactions, etc. can place heavy stress on servers. Flash crowds can occur at a server when there is a burst ...
Jay A. Patel, Indranil Gupta
ICTCS
2003
Springer
15 years 2 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
JOLLI
2010
106views more  JOLLI 2010»
14 years 8 months ago
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
Makoto Kanazawa
ECAI
2010
Springer
14 years 8 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
INFORMS
1998
150views more  INFORMS 1998»
14 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper