Sciweavers

12950 search results - page 71 / 2590
» On Optimal Timed Strategies
Sort
View
PVLDB
2010
103views more  PVLDB 2010»
13 years 7 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
CIKM
2005
Springer
14 years 2 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ARITH
2009
IEEE
14 years 3 months ago
Datapath Synthesis for Standard-Cell Design
Datapath synthesis for standard-cell design goes through extraction of arithmetic operations from RTL code, high-level arithmetic optimizations and netlist generation. Numerous ar...
Reto Zimmermann
INFOCOM
2006
IEEE
14 years 2 months ago
Controlled Flooding Search with Delay Constraints
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...
Nicholas B. Chang, Mingyan Liu
AAAI
2008
13 years 11 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...