Sciweavers

15485 search results - page 3053 / 3097
» Computing Optimal Subsets
Sort
View
DALT
2008
Springer
13 years 9 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
13 years 9 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
EDM
2008
127views Data Mining» more  EDM 2008»
13 years 9 months ago
Adaptive Test Design with a Naive Bayes Framework
Bayesian graphical models are commonly used to build student models from data. A number of standard algorithms are available to train Bayesian models from student skills assessment...
Michel C. Desmarais, Alejandro Villarreal, Michel ...
HIS
2007
13 years 9 months ago
Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
Crina Grosan, Ajith Abraham
ICWN
2008
13 years 9 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
« Prev « First page 3053 / 3097 Last » Next »