Sciweavers

2018 search results - page 135 / 404
» Code Normal Forms
Sort
View
IJCAI
2001
15 years 3 months ago
Computational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
Chitta Baral, Vladik Kreinovich, Raul Trejo
AAAI
1993
15 years 3 months ago
Comprehensibility Improvement of Tabular Knowledge Bases
This paper discusses the important issue of knowledge base comprehensibility and describes a technique for comprehensibility improvement. Comprehensibility is often measured by si...
Atsushi Sugiura, Maximilian Riesenhuber, Yoshiyuki...
AMC
2005
150views more  AMC 2005»
15 years 2 months ago
High order fitted operator numerical method for self-adjoint singular perturbation problems
We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hith...
Kailash C. Patidar
134
Voted
IV
2010
IEEE
211views Visualization» more  IV 2010»
15 years 1 months ago
Taggram: Exploring Geo-data on Maps through a Tag Cloud-Based Visualization
Searching and exploring on digital maps are normally performed through simple text boxes and zoomand-pan interfaces. In this paper, however, we present a novel technique, namely T...
Dinh-Quyen Nguyen, Heidrun Schumann
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 6 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...