580 search results - page 75 / 116 » Choosing a random peer |
107
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
WCNC
2010
IEEE
15 years 3 months ago
2010
IEEE
—This paper considers the medium access problem in the IEEE 802.11 standard. Although the transmission bit rates have clearly increased, some MAC related problems remain unsolved...
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
CG
2010
Springer
14 years 10 months ago
2010
Springer
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
103
click to vote
ICCAD
2009
IEEE
14 years 9 months ago
2009
IEEE
As CMOS devices are scaled down into the nanometer regime, concerns about reliability are mounting. Instead of viewing nanoscale characteristics as an impediment, technologies suc...