Sciweavers

176 search results - page 28 / 36
» Topics in the theory of DNA computing
Sort
View
CHI
2009
ACM
15 years 10 months ago
Tangibles for children, : the challenges
A significant proportion of research in the field of tangible interaction involves children. A common aspiration is to offer benefits through tangibility, related to ease of use a...
Bieke Zaman, Vero Vanden Abeele, Panos Markopoulos...
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
15 years 9 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
LPNMR
2009
Springer
15 years 4 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
JELIA
1998
Springer
15 years 1 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
GPC
2008
Springer
14 years 10 months ago
An Automatic and Scalable Testing Tool for Workflow Systems
Nowadays workflow systems are widely deployed around the world, especially within large international corporations. Thus the performance evaluation of these workflow systems becom...
Lin Quan, Xiaozhu Lin, Jianmin Wang