Sciweavers

721 search results - page 124 / 145
» Graphs with Large Obstacle Numbers
Sort
View
AAAI
1994
13 years 9 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
ENTCS
2008
95views more  ENTCS 2008»
13 years 8 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...
MST
2002
169views more  MST 2002»
13 years 7 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
CIKM
2010
Springer
13 years 6 months ago
MENTA: inducing multilingual taxonomies from wikipedia
In recent years, a number of projects have turned to Wikipedia to establish large-scale taxonomies that describe orders of magnitude more entities than traditional manually built ...
Gerard de Melo, Gerhard Weikum
JUCS
2010
179views more  JUCS 2010»
13 years 6 months ago
Ontology Visualization: Tools and Techniques for Visual Representation of Semi-Structured Meta-Data
: Ontologies are used to represent a variety of domain knowledge and data collections, scopes, viewpoints and linked heterogeneous information sources. They range from simple topol...
Monika Lanzenberger, Jennifer Sampson, Markus Rest...