default search action
CoRR, October 2002
- Krzysztof R. Apt:
Edsger Wybe Dijkstra (1930 - 2002): A Portrait of a Genius. - Alexander Barmouta, Rajkumar Buyya:
GridBank: A Grid Accounting Services Architecture (GASA) for Distributed Systems Sharing and Integration. - Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. - Salem Benferhat, Sylvain Lagrue, Odile Papini:
Revising Partially Ordered Beliefs. - Wen Chen:
Positive time fractional derivative. - Arne Andersson, Mikkel Thorup:
Dynamic Ordered Sets with Exponential Search Trees. - Paolo Liberatore, Marco Schaerf:
Compilability of Abduction. - Christoph Dürr, Ivan Rapaport, Guillaume Theyssier:
Cellular automata and communication complexity. - Maxim Makatchev:
On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata. - Nima Sarshar, Vwani P. Roychowdhury:
A Random Structure for Optimum Cache Size Distributed hash table (DHT) Peer-to-Peer design. - Aleksandar Ignjatovic:
A Note on Induction Schemas in Bounded Arithmetic. - Igor B. Konovalov:
Selection of future events from a time series in relation to estimations of forecasting uncertainty. - János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares Algorithm for Bin Packing. - A. S. Kirilov:
Current state of the Sonix - the IBR-2 instrument control software and plans for future developments. - Maarten H. van Emden:
New Developments in Interval Arithmetic and Their Implications for Floating-Point Standardization. - Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen:
Compact Floor-Planning via Orderly Spanning Trees. - Neil J. Gunther:
A New Interpretation of Amdahl's Law and Geometric Scalability. - T. G. Worlton, A. Chatterjee, J. P. Hammonds, P. F. Peterson, D. J. Mikkelson, R. L. Mikkelson:
User software for the next generation. - Petros Maniatis, Mary Baker:
A Historic Name-Trail Service. - Erik D. Demaine, Susan Hohenberger, David Liben-Nowell:
Tetris is Hard, Even to Approximate. - Jane Hunter:
Reconciling MPEG-7 and MPEG-21 Semantics through a Common Event-Aware Metadata Model. - Klaus Aehlig, Jan Johannsen:
An Elementary Fragment of Second-Order Lambda Calculus. - Timothy Porter:
Geometric Aspects of Multiagent Systems. - Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell, Steven Skiena:
The Lazy Bureaucrat Scheduling Problem. - Cosma Rohilla Shalizi, Kristina Lisa Shalizi, James P. Crutchfield:
An Algorithm for Pattern Discovery in Time Series. - Gonzalo Álvarez, Slobodan Petrovic:
Encoding a Taxonomy of Web Attacks with Different-Length Vectors. - Pascal Hitzler, Matthias Wendt:
A uniform approach to logic programming semantics. - Sara Cohen, Werner Nutt, Yehoshua Sagiv:
Equivalences Among Aggregate Queries with Negation. - Carlos Henrique Marcondes, Luís Fernando Sayão:
Integration and interoperability accessing electronic information resources in science and technology: the proposal of Brazilian Digital Library. - Johan A. K. Suykens, Joos Vandewalle, Bart De Moor:
Intelligence and Cooperative Search by Coupled Local Minimizers. - Srinidhi Varadarajan:
The Weaves Reconfigurable Programming Framework. - Michael Farber, Serge Tabachnikov, Sergey Yuzvinsky:
Topological robotics: motion planning in projective spaces. - Michael Farber, Sergey Yuzvinsky:
Topological Robotics: Subspace Arrangements and Collision Free Motion Planning. - Scott Aaronson:
Quantum Certificate Complexity. - Carlo A. Trugenberger:
Quantum Pattern Recognition. - Marcel Ausloos, Paulette Clippe, Andrzej Pekalski:
Simple Model for the Dynamics of Correlations in the Evolution of Economic Entities Under Varying Economic Conditions. - Kenton K. Yee:
Ownership and Trade from Evolutionary Games.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.