Sciweavers

1208 search results - page 36 / 242
» Uniform eventown problems
Sort
View
CAAN
2007
Springer
15 years 3 months ago
Preemptive Scheduling on Selfish Machines
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
Leah Epstein, Rob van Stee
SODA
2003
ACM
115views Algorithms» more  SODA 2003»
15 years 1 months ago
Random walks on the vertices of transportation polytopes with constant number of sources
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
Mary Cryan, Martin E. Dyer, Haiko Müller, Lee...
ICONIP
1998
15 years 1 months ago
A Study on Initialization for BP Networks
This paper proposes an initialization of back propagation (BP) networks for pattern classification problems; the weights of hidden units are initialized so that hyperplanes should...
Hiroshi Shiratsuchi, Hiromu Gotanda, Katsuhiro Ino...
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
15 years 1 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
LOGCOM
2006
116views more  LOGCOM 2006»
14 years 11 months ago
A Syntax-based Approach to Reasoning about Action and Belief Update
In this paper, we introduce an alternative approach to reasoning about action. The approach provides a solution to the frame and the ramification problem in a uniform manner. The ...
Quoc Bao Vo, Abhaya C. Nayak, Norman Y. Foo