Sciweavers

4894 search results - page 529 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
15 years 8 months ago
Mixed linear system estimation and identification
We consider a mixed linear system model, with both continuous and discrete inputs and outputs, described by a coefficient matrix and a set of noise variances. When the discrete inp...
Argyrios Zymnis, Stephen P. Boyd, Dimitry M. Gorin...
CEAS
2005
Springer
15 years 6 months ago
Computers beat Humans at Single Character Recognition in Reading based Human Interaction Proofs (HIPs)
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
Kumar Chellapilla, Kevin Larson, Patrice Y. Simard...
COCOA
2008
Springer
15 years 6 months ago
On Recovering Syntenic Blocks from Comparative Maps
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu
AIPS
2004
15 years 6 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
ECAI
2010
Springer
15 years 5 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert