Sciweavers

3172 search results - page 259 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
AAAI
1998
15 years 8 months ago
Discovering Admissible Simultaneous Equations of Large Scale Systems
SSFisasystemtodiscoverthestructureofsimultaneous equations governing an objective process through experiments. SSF combined with another system SDS to discover a quantitative form...
Takashi Washio, Hiroshi Motoda
USENIX
1993
15 years 8 months ago
Fremont: A System for Discovering Network Characteristics and Problems
In this paper we present an architecture and prototype implementation for discovering key network characteristics, such as hosts, gateways, and topology. The Fremont system uses a...
David C. M. Wood, Sean S. Coleman, Michael F. Schw...
IJCAI
1989
15 years 7 months ago
Managing Efficiently Temporal Relations Through Indexed Spanning Trees
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou­ sand time-tokens in demanding applications su...
Malik Ghallab, A. Mounir Alaoui
AI
2008
Springer
15 years 6 months ago
The measurement of ranks and the laws of iterated contraction
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking f...
Matthias Hild, Wolfgang Spohn
ENTCS
2006
124views more  ENTCS 2006»
15 years 6 months ago
Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions
The article introduces an extension of the well-known conformance relation ioco on labeled transition systems (LTS) with refused inputs and forbidden actions. This extension helps...
Igor B. Bourdonov, Alexander Kossatchev, Victor V....