Sciweavers

673 search results - page 119 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
JOTA
2011
78views more  JOTA 2011»
14 years 7 months ago
Outer Trust-Region Method for Constrained Optimization
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
Ernesto G. Birgin, Emerson V. Castelani, Andr&eacu...
JSC
2010
107views more  JSC 2010»
14 years 11 months ago
On the relation between Context and Sequence Unification
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...
Temur Kutsia, Jordi Levy, Mateu Villaret
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 11 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 6 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
INFOCOM
2005
IEEE
15 years 10 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...