Sciweavers

2027 search results - page 349 / 406
» When is it best to best-respond
Sort
View
104
Voted
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
15 years 6 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 6 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
CIKM
2005
Springer
15 years 6 months ago
Automatic construction of multifaceted browsing interfaces
Databases of text and text-annotated data constitute a significant fraction of the information available in electronic form. Searching and browsing are the typical ways that users...
Wisam Dakka, Panagiotis G. Ipeirotis, Kenneth R. W...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 6 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ISAAC
2005
Springer
76views Algorithms» more  ISAAC 2005»
15 years 6 months ago
Improved Algorithms for the k Maximum-Sums Problems
Given a sequence of n real numbers and an integer k, 1 k 1 2 n(n − 1), the k maximum-sum segments problem is to locate the k segments whose sums are the k largest among all poss...
Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-...