Sciweavers

2343 search results - page 385 / 469
» Structure and Interpretation of Computer Programs
Sort
View
ISSTA
2010
ACM
15 years 6 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
ACE
2003
180views Education» more  ACE 2003»
15 years 6 months ago
Managing the managers: Collaborative virtual teams with large staff and student numbers
Virtual teaming involving online presentations and peer reviews support the notion of collaborative student learning, whilst preparing them for the virtual work environment. Howev...
Kathy Egea
UAI
2004
15 years 6 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
RAS
2008
150views more  RAS 2008»
15 years 4 months ago
Logic-based robot control in highly dynamic domains
In this paper we present the robot programming and planning language Readylog, a Golog dialect which was developed to support the decision making of robots acting in dynamic real-...
Alexander Ferrein, Gerhard Lakemeyer
IJPP
2010
156views more  IJPP 2010»
15 years 2 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...