Sciweavers

349 search results - page 38 / 70
» Generating Lexical Analogies Using Dependency Relations
Sort
View
JCSC
2000
106views more  JCSC 2000»
13 years 7 months ago
Implementation of a Long Range LRF by Automatic Multi-Mode Measurement Scheme
A long range Laser Range Finder (LRF) is proposed and developed in this paper. A mathematical model, which relates the relation between object distance and Position Sensitive Dete...
Manukid Parnichkun, Viraphan Samadi
HASKELL
2005
ACM
14 years 1 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
WAC
2005
Springer
118views Communications» more  WAC 2005»
14 years 1 months ago
Experiments on the Automatic Evolution of Protocols Using Genetic Programming
Truly autonomic networks ultimately require self-modifying, evolving protocol software. Otherwise humans must intervene in every situation that has not been anticipated at design t...
Lidia Yamamoto, Christian F. Tschudin
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
CICLING
2003
Springer
14 years 1 months ago
Starting with Complex Primitives Pays Off
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
Aravind K. Joshi