Sciweavers

3708 search results - page 161 / 742
» Approximating Betweenness Centrality
Sort
View
FGCS
2006
68views more  FGCS 2006»
15 years 4 months ago
Using zero configuration technology for IP addressing in optical networks
Host configuration in optical networks is usually done by hand. In this paper we propose to use zero configuration techniques, including self-assigned IP addresses and multicast D...
Freek Dijkstra, Jeroen van der Ham, Cees T. A. M. ...
ACL
2009
15 years 2 months ago
Learning Semantic Correspondences with Less Supervision
A central problem in grounded language acquisition is learning the correspondences between a rich world state and a stream of text which references that world state. To deal with ...
Percy Liang, Michael I. Jordan, Dan Klein
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 11 months ago
Traced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
ICML
2002
IEEE
16 years 5 months ago
Algorithm-Directed Exploration for Model-Based Reinforcement Learning in Factored MDPs
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...
Carlos Guestrin, Relu Patrascu, Dale Schuurmans
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 11 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López