Sciweavers

10493 search results - page 204 / 2099
» Dynamic Word Problems
Sort
View
JUCS
2000
117views more  JUCS 2000»
13 years 8 months ago
The Light Control Case Study: Problem Description
: This document contains a range of needs and requirements concerning the construction of a light control system for a floor of a university building. A description of the building...
Stefan Queins, Gerhard Zimmermann, Martin Becker, ...
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 8 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
SIAMJO
2002
89views more  SIAMJO 2002»
13 years 7 months ago
A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
Stephen C. Billups, Layne T. Watson
MOR
2010
108views more  MOR 2010»
13 years 6 months ago
Accuracy Certificates for Computational Problems with Convex Structure
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum
STTT
2010
132views more  STTT 2010»
13 years 6 months ago
Evaluation of Kermeta for solving graph-based problems
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Bar...