Sciweavers

1054 search results - page 99 / 211
» A Formalization of the Turing Test
Sort
View
LICS
2012
IEEE
13 years 8 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
GECCO
2010
Springer
172views Optimization» more  GECCO 2010»
15 years 11 months ago
Designing better fitness functions for automated program repair
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
Ethan Fast, Claire Le Goues, Stephanie Forrest, We...
CDC
2008
IEEE
140views Control Systems» more  CDC 2008»
16 years 27 days ago
Reachability calculations for automated aerial refueling
— This paper describes reachability calculations for a hybrid system formalism governing UAVs interacting with another vehicle in a safety-critical situation. We examine this pro...
Jerry Ding, Jonathan Sprinkle, Shankar S. Sastry, ...
KBSE
2005
IEEE
15 years 12 months ago
Properties and scopes in web model checking
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
May Haydar, Sergiy Boroday, Alexandre Petrenko, Ho...
SEFM
2005
IEEE
15 years 12 months ago
Formalising Control in Robust Spoken Dialogue Systems
The spoken language interface is now becoming an increasingly serious research topic with application to a wide range of highly engineered systems. Such systems not only include i...
Hui Shi, Robert J. Ross, John A. Bateman