Sciweavers

1872 search results - page 64 / 375
» The Art of Granular Computing
Sort
View
CG
2010
Springer
13 years 8 months ago
Score Bounded Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
Tristan Cazenave, Abdallah Saffidine
ACL
2012
12 years 11 days ago
Native Language Detection with Tree Substitution Grammars
We investigate the potential of Tree Substitution Grammars as a source of features for native language detection, the task of inferring an author’s native language from text in ...
Benjamin Swanson, Eugene Charniak
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
14 years 3 months ago
An Iterative Algorithm for Battery-Aware Task Scheduling on Portable Computing Platforms
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
Jawad Khan, Ranga Vemuri
ADBIS
2000
Springer
169views Database» more  ADBIS 2000»
14 years 2 months ago
Data Organization Issues for Location-Dependent Queries in Mobile Computing
We consider queries which originate from a mobile unit and whose result depends on the location of the user who initiates the query. Example of such a query is How many people are ...
Sanjay Kumar Madria, Bharat K. Bhargava, Evaggelia...
GIS
1999
ACM
14 years 2 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas