Sciweavers

4426 search results - page 753 / 886
» Concurrent Constraint Programming
Sort
View
ESOP
2009
Springer
15 years 8 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
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 8 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
SC
1995
ACM
15 years 8 months ago
A Novel Approach Towards Automatic Data Distribution
: Data distribution is one of the key aspects that a parallelizing compiler for a distributed memory architecture should consider, in order to get efficiency from the system. The ...
Jordi Garcia, Eduard Ayguadé, Jesús ...
CPAIOR
2010
Springer
15 years 7 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
DFKI
2005
Springer
15 years 6 months ago
Multiagent Systems Without Agents - Mirror-Holons for the Compilation and Enactment of Communication Structures
It is widely accepted in Distributed Artificial Intelligence that a crucial property of artificial agents is their autonomy. Whereas agent autonomy enables features of agent-base...
Matthias Nickles, Gerhard Weiß