Sciweavers

245 search results - page 35 / 49
» Efficient Solving of Time-dependent Answer Set Programs
Sort
View
EAAI
2008
101views more  EAAI 2008»
14 years 11 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
MP
2006
101views more  MP 2006»
14 years 11 months ago
Robust optimization of contaminant sensor placement for community water systems
We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or accidentally injected. We f...
Robert D. Carr, Harvey J. Greenberg, William E. Ha...
WCE
2007
15 years 27 days ago
Scenario Generation Employing Copulas
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
Kristina Sutiene, Henrikas Pranevicius
APPT
2005
Springer
15 years 5 months ago
Autonomous-Centered Problem Allocation Oriented to Cooperation
By reasonably allocating a cooperative problem which need multiple solvers cope with together, the problem could be performed more effectively and efficiently. A problem could be d...
Xiping Liu, Wan-Chun Dou, Guihai Chen, Shijie Cai,...
ICML
2009
IEEE
16 years 17 days ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht