5622 search results - page 1007 / 1125 » Solving architectural modelling problems using knowledge |
154
Voted
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
126
Voted
CIAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
153
Voted
APSEC
2001
IEEE
15 years 7 months ago
2001
IEEE
Word processing software, email, and spreadsheet have revolutionized office activities. There are many other office tasks that are amenable to automation, such as: scheduling a vi...
122
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Despite the recent advances in planning with MDPs, the problem of generating good policies is still hard. This paper describes a way to generate policies in MDPs by (1) determiniz...
138
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
: Collaborative Dual-PLSA: Mining Distinction and Commonality across Multiple Domains for Text Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhon...