Sciweavers

350 search results - page 51 / 70
» Uncertainty in Soft Constraint Problems
Sort
View
AI
2006
Springer
13 years 7 months ago
Constraint-based optimization and utility elicitation using the minimax decision criterion
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
Craig Boutilier, Relu Patrascu, Pascal Poupart, Da...
ATAL
2006
Springer
13 years 11 months ago
Information-theoretic approaches to branching in search
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
Andrew Gilpin, Tuomas Sandholm
EMMCVPR
2005
Springer
14 years 1 months ago
Reverse-Convex Programming for Sparse Image Codes
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
Matthias Heiler, Christoph Schnörr
INFOCOM
2009
IEEE
14 years 2 months ago
Impairment-Aware Offline RWA for Transparent Optical Networks
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...
Konstantinos Manousakis, Kostas Christodoulopoulos...
IPPS
2006
IEEE
14 years 1 months ago
Automatic application-specific microarchitecture reconfiguration
Applications for constrained embedded systems are subject to strict time constraints and restrictive resource utilization. With soft core processors, application developers can cu...
Shobana Padmanabhan, Ron K. Cytron, Roger D. Chamb...