Sciweavers

11740 search results - page 384 / 2348
» More Problems in Rewriting
Sort
View
CP
2006
Springer
15 years 10 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
FLAIRS
2007
15 years 9 months ago
Structure Information in Decision Trees and Similar Formalisms
In attempting to address real-life decision problems, where uncertainty about input data prevails, some kind of representation of imprecise information is important and several ha...
Mats Danielson, Love Ekenberg, David Sundgren
FLAIRS
2007
15 years 9 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
CEAS
2005
Springer
15 years 8 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 8 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