Sciweavers

1132 search results - page 141 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
AAAI
1992
15 years 7 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
DAM
2010
111views more  DAM 2010»
15 years 6 months ago
Covering line graphs with equivalence relations
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
Louis Esperet, John Gimbel, Andrew King
AMC
2006
173views more  AMC 2006»
15 years 6 months ago
Data envelopment analysis with missing values: An interval DEA approach
Missing values in inputs, outputs cannot be handled by the original data envelopment analysis (DEA) models. In this paper we introduce an approach based on interval DEA that allow...
Yannis G. Smirlis, Elias K. Maragos, Dimitris K. D...
JAIR
2008
103views more  JAIR 2008»
15 years 6 months ago
ICE: An Expressive Iterative Combinatorial Exchange
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
Benjamin Lubin, Adam I. Juda, Ruggiero Cavallo, S&...
DC
2007
15 years 6 months ago
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
Josef Widder, Ulrich Schmid