Sciweavers

1941 search results - page 315 / 389
» The representation of planning strategies
Sort
View
FSTTCS
2008
Springer
13 years 11 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
WSDM
2012
ACM
243views Data Mining» more  WSDM 2012»
12 years 6 months ago
No search result left behind: branching behavior with browser tabs
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
Jeff Huang, Thomas Lin, Ryen W. White
VLDB
2007
ACM
124views Database» more  VLDB 2007»
14 years 4 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...
VISUALIZATION
2005
IEEE
14 years 4 months ago
Particle and Texture Based Spatiotemporal Visualization of Time-Dependent Vector Fields
We propose a hybrid particle and texture based approach for the visualization of time-dependent vector fields. The underlying spacetime framework builds a dense vector field rep...
Daniel Weiskopf, Frederik Schramm, Gordon Erlebach...
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 4 months ago
Constructive induction and genetic algorithms for learning concepts with complex interaction
Constructive Induction is the process of transforming the original representation of hard concepts with complex interaction into a representation that highlights regularities. Mos...
Leila Shila Shafti, Eduardo Pérez