Sciweavers

4131 search results - page 409 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
AAAI
2010
15 years 7 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner
NIPS
2008
15 years 7 months ago
Domain Adaptation with Multiple Sources
This paper presents a theoretical analysis of the problem of domain adaptation with multiple sources. For each source domain, the distribution over the input points as well as a h...
Yishay Mansour, Mehryar Mohri, Afshin Rostamizadeh
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 7 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
SIP
2003
15 years 7 months ago
Design of Full Band IIR Digital Differentiators
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...
Xi Zhang, Toshinori Yoshikawa
ANOR
2007
151views more  ANOR 2007»
15 years 6 months ago
Distributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
Eliezer Kaplansky, Amnon Meisels