Sciweavers

3946 search results - page 678 / 790
» The computational complexity of choice sets
Sort
View
FSTTCS
2008
Springer
15 years 7 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
GECCO
2008
Springer
174views Optimization» more  GECCO 2008»
15 years 7 months ago
Mask functions for the symbolic modeling of epistasis using genetic programming
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
Ryan J. Urbanowicz, Nate Barney, Bill C. White, Ja...
SIGMETRICS
2010
ACM
181views Hardware» more  SIGMETRICS 2010»
15 years 6 months ago
A unified modeling framework for distributed resource allocation of general fork and join processing networks
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
GLOBECOM
2007
IEEE
15 years 6 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor
ADHOC
2010
97views more  ADHOC 2010»
15 years 6 months ago
Modeling and analysis of two-flow interactions in wireless networks
Abstract--Interference plays a complex and often defining role in the performance of wireless networks, especially in multi-hop scenarios. In the presence of interference, Carrier ...
Saquib Razak, Vinay Kolar, Nael B. Abu-Ghazaleh