Sciweavers

844 search results - page 104 / 169
» Solving the p
Sort
View
TRANSCI
2010
98views more  TRANSCI 2010»
15 years 19 days ago
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
Alan L. Erera, Juan C. Morales, Martin W. P. Savel...
ICASSP
2011
IEEE
14 years 9 months ago
Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks using the Nash Bargaining S
We consider the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network (VSN). We use the Nash Bargaining Solut...
Katerina Pandremmenou, Lisimachos P. Kondi, Konsta...
ICANN
2011
Springer
14 years 9 months ago
Bias of Importance Measures for Multi-valued Attributes and Solutions
Attribute importance measures for supervised learning are important for improving both learning accuracy and interpretability. However, it is well-known there could be bias when th...
Houtao Deng, George C. Runger, Eugene Tuv
AAAI
2012
13 years 8 months ago
Real-Time Collaborative Planning with the Crowd
Planning is vital to a wide range of domains, including robotics, military strategy, logistics, itinerary generation and more, that both humans and computers find difficult. Col...
Walter S. Lasecki, Jeffrey P. Bigham, James F. All...
ASIACRYPT
2009
Springer
16 years 16 days ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...