Sciweavers

3433 search results - page 286 / 687
» Heuristics for a bidding problem
Sort
View
IWCMC
2006
ACM
16 years 21 days ago
Tracers placement for IP traceback against DDoS attacks
This paper explores the tracers deployment problem for IP traceback methods how many and where the tracers should be deployed in the network to be effective for locating the attac...
Chun-Hsin Wang, Chang-Wu Yu, Chiu-Kuo Liang, Kun-M...
173
Voted
ATAL
2004
Springer
16 years 4 days ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
AINA
2010
IEEE
15 years 12 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
AAAI
2007
15 years 9 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
ML
2006
ACM
110views Machine Learning» more  ML 2006»
15 years 6 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez