Sciweavers

1179 search results - page 189 / 236
» Programming in Hybrid Constraint Languages
Sort
View
ESOP
2009
Springer
14 years 2 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
AI
2003
Springer
14 years 3 months ago
Pattern-Based AI Scripting Using ScriptEase
Creating realistic artificially-intelligent characters is seen as one of the major challenges of the commercial games industry. Historically, character behavior has been specifie...
Matthew McNaughton, James Redford, Jonathan Schaef...
ICLP
2004
Springer
14 years 3 months ago
Protein Folding Simulation in CCP
A protein is identified by a finite sequence of aminoacids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting t...
Alessandro Dal Palù, Agostino Dovier, Feder...
SPAA
2010
ACM
13 years 10 months ago
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
JongSoo Park, William J. Dally
IFIP
2010
Springer
13 years 5 months ago
Information Flow Analysis via Path Condition Refinement
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
Mana Taghdiri, Gregor Snelting, Carsten Sinz