Sciweavers

784 search results - page 55 / 157
» Discovering and using groups to improve personalized search
Sort
View
SPIN
2007
Springer
15 years 8 months ago
Generating Counter-Examples Through Randomized Guided Search
Abstract. Computational resources are increasing rapidly with the explosion of multi-core processors readily available from major vendors. Model checking needs to harness these res...
Neha Rungta, Eric G. Mercer
MOBICOM
2010
ACM
15 years 2 months ago
SMS-based web search for low-end mobile devices
Short Messaging Service (SMS) based mobile information services have become increasingly common around the world, especially in emerging regions among users with low-end mobile de...
Jay Chen, Lakshminarayanan Subramanian, Eric A. Br...
BMCBI
2007
190views more  BMCBI 2007»
15 years 2 months ago
Discriminative motif discovery in DNA and protein sequences using the DEME algorithm
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
Emma Redhead, Timothy L. Bailey
CIG
2005
IEEE
15 years 7 months ago
Combining Tactical Search and Monte-Carlo in the Game of Go
We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting go...
Tristan Cazenave, Bernard Helmstetter
ATAL
2003
Springer
15 years 7 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...