Sciweavers

3433 search results - page 211 / 687
» Heuristics for a bidding problem
Sort
View
AGENTS
2001
Springer
15 years 11 months ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu
TOPNOC
2008
15 years 6 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
JDCTA
2010
135views more  JDCTA 2010»
15 years 1 months ago
Signal Framing Methods of Automotive Embedded Networked Control System for Bandwidth Consumption Optimization
Parameter (or variable) of automotive embedded networked control system is named as signal. In order to improve system performance and provide more remaining bandwidth for system ...
Jian Hu, Gangyan Li, Yeqiong Song
AUSAI
2007
Springer
15 years 10 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
JMLR
2006
145views more  JMLR 2006»
15 years 6 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street