Sciweavers

1679 search results - page 110 / 336
» Strong order equivalence
Sort
View
ALT
2008
Springer
14 years 7 months ago
Optimal Language Learning
Gold’s original paper on inductive inference introduced a notion of an optimal learner. Intuitively, a learner identifies a class of objects optimally iff there is no other lea...
John Case, Samuel E. Moelius
PE
2002
Springer
176views Optimization» more  PE 2002»
13 years 9 months ago
Effective bandwidth estimation and testing for Markov sources
This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source ...
Juan Pechiar, Gonzalo Perera, María Simon
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 1 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
Nikhil R. Devenur, Thomas P. Hayes
BIRTHDAY
2000
Springer
14 years 2 months ago
Bistructures, bidomains, and linear logic
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
Pierre-Louis Curien, Gordon D. Plotkin, Glynn Wins...