Sciweavers

1650 search results - page 36 / 330
» How to Turn the Page
Sort
View
CIE
2010
Springer
15 years 1 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
14 years 10 months ago
How social structure and institutional order co-evolve beyond instrumental rationality
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
Jae-Woo Kim
BMCBI
2006
101views more  BMCBI 2006»
14 years 9 months ago
How repetitive are genomes?
Background: Genome sequences vary strongly in their repetitiveness and the causes for this are still debated. Here we propose a novel measure of genome repetitiveness, the index o...
Bernhard Haubold, Thomas Wiehe
SIGIR
2004
ACM
15 years 3 months ago
Block-based web search
Multiple-topic and varying-length of web pages are two negative factors significantly affecting the performance of web search. In this paper, we explore the use of page segmentati...
Deng Cai, Shipeng Yu, Ji-Rong Wen, Wei-Ying Ma
WIKIS
2009
ACM
15 years 4 months ago
Wikipublisher: a print-on-demand Wiki
Web and print exist as two solitudes: printed web pages often disappoint and converting print documents into good web pages is hard. A wiki makes it easy for authors to create ric...
John Rankin, Craig Anslow, James Noble, Brenda Cha...