Sciweavers

207 search results - page 32 / 42
» Elementary Strong Functional Programming
Sort
View
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 2 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
TPDS
2010
93views more  TPDS 2010»
13 years 6 months ago
Self-Consistent MPI Performance Guidelines
Message passing using the Message Passing Interface (MPI) is at present the most widely adopted framework for programming parallel applications for distributed-memory and clustere...
Jesper Larsson Träff, William D. Gropp, Rajee...
DIMACS
1996
13 years 9 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ECAI
2006
Springer
13 years 11 months ago
Learning Behaviors Models for Robot Execution Control
Robust execution of robotic tasks is a difficult problem. In many situations, these tasks involve complex behaviors combining different functionalities (e.g. perception, localizat...
Guillaume Infantes, Félix Ingrand, Malik Gh...
ATMOS
2008
124views Optimization» more  ATMOS 2008»
13 years 9 months ago
Simultaneous Network Line Planning and Traffic Assignment
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
Karl Nachtigall, Karl Jerosch