Sciweavers

721 search results - page 104 / 145
» Graphs with Large Obstacle Numbers
Sort
View
WSC
2008
13 years 11 months ago
Using OMG'S SYSML to support simulation
Currently, system engineering problems are solved using a wide range of domain-specific models and corresponding languages. It is unlikely that a single unified modeling language ...
Christiaan J. J. Paredis, Thomas Johnson
CONCUR
2006
Springer
13 years 11 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
SIROCCO
2007
13 years 10 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
ML
2008
ACM
128views Machine Learning» more  ML 2008»
13 years 9 months ago
QG/GA: a stochastic search for Progol
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...
Stephen Muggleton, Alireza Tamaddoni-Nezhad
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
11 years 11 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...