Sciweavers

16091 search results - page 255 / 3219
» Solving
Sort
View
SAC
2011
ACM
14 years 9 months ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
CAEPIA
2011
Springer
14 years 6 months ago
Solving Sequential Mixed Auctions with Integer Programming
Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions ...
Boris Mikhaylov, Jesús Cerquides, Juan A. R...
CORR
2012
Springer
180views Education» more  CORR 2012»
14 years 2 months ago
Solving Cooperative Reliability Games
Cooperative games model the allocation of profit from joint actions, following considerations such as stability and fairness. We propose the reliability extension of such games, ...
Yoram Bachrach, Reshef Meir, Michal Feldman, Moshe...
IUI
2012
ACM
14 years 2 months ago
Mobile texting: can post-ASR correction solve the issues? an experimental study on gain vs. costs
The next big step in embedded, mobile speech recognition will be to allow completely free input as it is needed for messaging like SMS or email. However, unconstrained dictation r...
Michael Feld, Saeedeh Momtazi, Farina Freigang, Di...