Sciweavers

12194 search results - page 361 / 2439
» cans 2010
Sort
View
CMA
2010
68views more  CMA 2010»
15 years 4 months ago
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
Sandi Klavzar, Khaled Salem, Andrej Taranenko
COGCOM
2010
112views more  COGCOM 2010»
15 years 4 months ago
Flexible Latching: A Biologically-Inspired Mechanism for Improving the Management of Homeostatic Goals
Controlling cognitive systems like domestic robots or intelligent assistive environments requires striking an appropriate balance between responsiveness and persistence. Basic goal...
Philipp Rohlfshagen, Joanna Bryson
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
15 years 4 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 4 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
DEBU
2010
139views more  DEBU 2010»
15 years 4 months ago
Refining Information Extraction Rules using Data Provenance
Developing high-quality information extraction (IE) rules, or extractors, is an iterative and primarily manual process, extremely time consuming, and error prone. In each iteratio...
Bin Liu 0002, Laura Chiticariu, Vivian Chu, H. V. ...