Sciweavers

793 search results - page 23 / 159
» Input Modeling Tools for Complex Problems
Sort
View
COCOON
2007
Springer
14 years 2 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
CIE
2007
Springer
14 years 2 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
KBSE
1998
IEEE
14 years 22 days ago
Towards the Automated Debugging and Maintenance of Logic-based Requirements Models
In this paper we describe a tools environment which automates the validation and maintenance of a requirements model written in many-sorted first order logic. We focus on: a trans...
T. L. McCluskey, Margaret Mary West
ICPR
2004
IEEE
14 years 9 months ago
Complex Human Activity Recognition for Monitoring Wide Outdoor Environments
The problem of automatic recognition of human activities is among the most important and challenging open areas of research in Computer Vision. This paper presents a new approach ...
Arcangelo Distante, I. Gnoni, Marco Leo, Paolo Spa...
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 3 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman