Sciweavers

1598 search results - page 229 / 320
» A Unified Computation Model for Functional and Logic Program...
Sort
View
ICALP
2004
Springer
16 years 4 days ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
PARLE
1992
15 years 10 months ago
Characterizing the Paralation Model using Dynamic Assignment
Collection-oriented languages provide high-level constructs for describing computations over collections. These languages are becoming increasingly popular with the advent of massi...
Eric T. Freeman, Daniel P. Friedman
MICAI
2005
Springer
16 years 7 days ago
Agent-Based Simulation Replication: A Model Driven Architecture Approach
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...
Candelaria Sansores, Juan Pavón
AIED
2009
Springer
16 years 1 months ago
From Conceptual Models to Agent-based Simulations: Why and How
The core problem we address in this paper is how to take a declarative conceptual representation of a complex system and produce an agent-based simulation of that model. In particu...
Swaroop Vattam, Ashok K. Goel, Spencer Rugaber, Ci...
171
Voted
JCC
2008
92views more  JCC 2008»
15 years 6 months ago
Fast procedure for reconstruction of full-atom protein models from reduced representations
: We introduce PULCHRA, a fast and robust method for the reconstruction of full-atom protein models starting from a reduced protein representation. The algorithm is particularly su...
Piotr Rotkiewicz, Jeffrey Skolnick