Sciweavers

15073 search results - page 410 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
178
Voted
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
16 years 24 days ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
190
Voted
CEC
2007
IEEE
16 years 1 months ago
Computational chemotaxis in ants and bacteria over dynamic environments
— Chemotaxis can be defined as an innate behavioural response by an organism to a directional stimulus, in which bacteria, and other single-cell or multicellular organisms direct...
Vitorino Ramos, Carlos Fernandes, Agostinho C. Ros...
159
Voted
DAC
2001
ACM
16 years 7 months ago
An Algorithm for Bi-Decomposition of Logic Functions
We propose a new BDD-based method for decomposition of multi-output incompletely specified logic functions into netlists of two-input logic gates. The algorithm uses the internal ...
Alan Mishchenko, Bernd Steinbach, Marek A. Perkows...
172
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
198
Voted
AIPS
2008
15 years 9 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan