Sciweavers

8337 search results - page 1526 / 1668
» Reasoning With Characteristic Models
Sort
View
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
15 years 2 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
DASFAA
2011
IEEE
341views Database» more  DASFAA 2011»
15 years 2 months ago
Utility-Oriented K-Anonymization on Social Networks
\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
Yazhe WANG, Long XIE, Baihua ZHENG, and Ken C. K. ...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 2 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...
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 2 months ago
Ontology-based Queries over Cancer Data
The ever-increasing amount of data in biomedical research, and in cancer research in particular, needs to be managed to support efficient data access, exchange and integration. Exi...
Alejandra González Beltrán, Ben Tagg...
143
Voted
ELECTRONICMARKETS
2010
124views more  ELECTRONICMARKETS 2010»
15 years 2 months ago
The difficulty of studying inter-organisational IS phenomena on large scales: critical reflections on a research journey
We argue that certain theoretical commitments that underpin much existing Interorganisational Information Systems (IOIS) research at small scales become untenable when IOIS are st...
Kai Reimers, Robert B. Johnston, Stefan Klein
« Prev « First page 1526 / 1668 Last » Next »