Sciweavers

1168 search results - page 162 / 234
» Optimization strategies for complex queries
Sort
View
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
OWLED
2008
14 years 11 months ago
HermiT: A Highly-Efficient OWL Reasoner
Abstract. HermiT is a new OWL reasoner based on a novel "hypertableau" calculus. The new calculus addresses performance problems due to nondeterminism and model size--the...
Rob Shearer, Boris Motik, Ian Horrocks
MOBICOM
2006
ACM
15 years 4 months ago
Component based channel assignment in single radio, multi-channel ad hoc networks
In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment...
Ramanuja Vedantham, Sandeep Kakumanu, Sriram Laksh...
ATAL
2003
Springer
15 years 3 months ago
A principled study of the design tradeoffs for autonomous trading agents
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
Ioannis A. Vetsikas, Bart Selman
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
15 years 10 months ago
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...