Sciweavers

364 search results - page 42 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
INFOCOM
1994
IEEE
13 years 11 months ago
Optimal Multiplexing on a Single Link: Delay and Buffer Requirements
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
Leonidas Georgiadis, Roch Guérin, Abhay K. ...
CSL
2008
Springer
13 years 9 months ago
Quantitative Languages
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
NDQA
2003
156views Education» more  NDQA 2003»
13 years 8 months ago
Toward a Question Answering Roadmap
Growth in government investment, academic research, and commercial question answering (QA) systems is motivating a need for increased planning and coordination. The internationali...
Mark T. Maybury
VMCAI
2004
Springer
14 years 23 days ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
ESOP
2010
Springer
14 years 4 months ago
A Grammar-based Approach to Invertible Programs
Abstract. Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by man...
Kazutaka Matsuda, Shin-Cheng Mu, Zhenjiang Hu and ...