Sciweavers

1073 search results - page 180 / 215
» Formal Program Development with Approximations
Sort
View
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 7 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
JCIT
2007
192views more  JCIT 2007»
13 years 7 months ago
Action Representation for Natural Language Interfaces to Agent Systems
In this paper, we outline a framework for the development of natural language interfaces to agent systems with a focus on action representation. The architecture comprises a natur...
Christel Kemke
JSW
2007
102views more  JSW 2007»
13 years 7 months ago
Model-driven Engineering for Early QoS Validation of Component-based Software Systems
— Model-driven engineering (MDE) techniques are increasingly being used to address many of the development and operational lifecycle concerns of large-scale component-based syste...
James H. Hill, Aniruddha S. Gokhale
ICML
2006
IEEE
14 years 8 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 8 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...