Sciweavers

15375 search results - page 2682 / 3075
» cans 2008
Sort
View
AISC
2008
Springer
15 years 9 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
AISC
2008
Springer
15 years 9 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
AISC
2008
Springer
15 years 9 months ago
Case Studies in Model Manipulation for Scientific Computing
Abstract. The same methodology is used to develop 3 different applications. We begin by using a very expressive, appropriate Domain Specific Language, to write down precise problem...
Jacques Carette, Spencer Smith, John McCutchan, Ch...
ALGOSENSORS
2008
Springer
15 years 9 months ago
Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
We consider the problem of uniformly dispersing mobile robotic sensors in a simply connected orthogonal space of unknown shape. The mobile sensors are injected into the space from ...
Eduardo Mesa Barrameda, Shantanu Das, Nicola Santo...
AMAST
2008
Springer
15 years 9 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
« Prev « First page 2682 / 3075 Last » Next »