Sciweavers

1593 search results - page 139 / 319
» A visual programming system for automated problem solving
Sort
View
CADE
2007
Springer
15 years 10 months ago
Proving Termination by Bounded Increase
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
Jürgen Giesl, René Thiemann, Stephan S...
153
Voted
MM
2003
ACM
190views Multimedia» more  MM 2003»
15 years 9 months ago
Human + agent: creating recombinant information
combinFormation is a tool that enables browsing and collecting information elements in a generative space. By generative, we mean that the tool is an agent that automatically retr...
Andruid Kerne, Vikram Sundaram, Jin Wang, Madhur K...
UIST
2004
ACM
15 years 9 months ago
Hierarchical parsing and recognition of hand-sketched diagrams
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
Levent Burak Kara, Thomas F. Stahovich
JIPS
2006
129views more  JIPS 2006»
15 years 4 months ago
Automatic Reading System for On-off Type DNA Chip
: In this study we propose an automatic reading system for diagnostic DNA chips. We define a general specification for an automatic reading system and propose a possible implementa...
Munho Ryu, Jong Dae Kim, Jongwon Kim
ICCBR
2003
Springer
15 years 9 months ago
Soft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Nicoleta Neagu, Boi Faltings