Sciweavers

1948 search results - page 382 / 390
» Formalizing Mirror Theory
Sort
View
ESWA
2006
122views more  ESWA 2006»
13 years 8 months ago
Ontology construction for information classification
Following the advent of the Internet technology and the rapid growth of its applications, users have spent long periods of time browsing through the ocean of information found in ...
Sung-Shun Weng, Hsine-Jen Tsai, Shang-Chia Liu, Ch...
FAC
2006
122views more  FAC 2006»
13 years 8 months ago
The verified software repository: a step towards the verifying compiler
The Verified Software Repository is dedicated to a long-term vision of a future in which all computer systems justify the trust that Society increasingly places in them. This will ...
Juan Bicarregui, C. A. R. Hoare, J. C. P. Woodcock
IWC
2008
99views more  IWC 2008»
13 years 8 months ago
Pedagogy and usability in interactive algorithm visualizations: Designing and evaluating CIspace
Interactive algorithm visualizations (AVs) are powerful tools for teaching and learning concepts that are difficult to describe with static media alone. However, while countless A...
Saleema Amershi, Giuseppe Carenini, Cristina Conat...
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
KI
2006
Springer
13 years 8 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler