text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
as this The main thesis follows. of contributions are | The main contributions of this thesis are as follows. | 9,300 |
useful information the to provide uses technique SAR blanket image method for classification. This | This method uses the blanket technique to provide useful information for SAR image classification. | 9,301 |
a classification for technique different five terrain As result, a types, i.e. | As a result, a classification technique for five different terrain types, i.e. | 9,302 |
and is suburban, urban, in mountain presented sea, this paper. rural, | urban, suburban, rural, mountain and sea, is presented in this paper. | 9,303 |
is solving except to often problems due However, a for intractable small their complexity. POMDP | However, solving a POMDP is often intractable except for small problems due to their complexity. | 9,304 |
storytelling, particular an and of the in important part human Narrative, is experience. | Narrative, and in particular storytelling, is an important part of the human experience. | 9,305 |
success to its is Central this understandability. | Central to this success is its understandability. | 9,306 |
intentional the be agents. perceived must to by audience characters be Specifically, | Specifically, characters must be perceived by the audience to be intentional agents. | 9,307 |
to a with is satisfiability eminent Planning principal planning many approach advantages. as | Planning as satisfiability is a principal approach to planning with many eminent advantages. | 9,308 |
encodings STRIPS. The as usually use satisfiability from existing compiled techniques planning | The existing planning as satisfiability techniques usually use encodings compiled from STRIPS. | 9,309 |
the (SASE) SAT scheme encoding formalism. on a We based SAS+ introduce novel | We introduce a novel SAT encoding scheme (SASE) based on the SAS+ formalism. | 9,310 |
statistical to results We analysis. empirical support give our | We give empirical statistical results to support our analysis. | 9,311 |
paper develops make algorithm that the FODD improvements approach This to practical. the several | This paper develops several improvements to the FODD algorithm that make the approach practical. | 9,312 |
planning system, relational planning paper a presents the Incorporating for solving these, FODD-Planner, stochastic problems. | Incorporating these, the paper presents a planning system, FODD-Planner, for solving relational stochastic planning problems. | 9,313 |
its in The comparison. problem has genome application | The problem has its application in genome comparison. | 9,314 |
to solutions a MAX-MIN quality ant the employ we system achieve problem. for high Subsequently, | Subsequently, we employ a MAX-MIN ant system to achieve high quality solutions for the problem. | 9,315 |
by is achieved test. statistical improvement The justified also standard | The improvement achieved is also justified by standard statistical test. | 9,316 |
cortex in debated. highly orientation emergence primary the visual underlying of selectivity the Mechanisms are | Mechanisms underlying the emergence of orientation selectivity in the primary visual cortex are highly debated. | 9,317 |
accounts perform a which for mean-field analysis Here, this process. we | Here, we perform a mean-field analysis which accounts for this process. | 9,318 |
The problem cycle an (HCP) important problem many in combinatorial Hamiltonian with is areas. applications | The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. | 9,319 |
main this work contribution algorithm the DHCP. an is of effective The for | The main contribution of this work is an effective algorithm for the DHCP. | 9,320 |
graphs key task network mapping is of data. complex the of in Visual a rendering | Visual rendering of graphs is a key task in the mapping of complex network data. | 9,321 |
centrality-constrained determined the embeddings. optimization yielding to solutions meaningful are problems Closed-form resulting | Closed-form solutions to the resulting centrality-constrained optimization problems are determined yielding meaningful embeddings. | 9,322 |
hypotheses. leads to diagnostic number Model-based reasoning a large often diagnostic of | Model-based diagnostic reasoning often leads to a large number of diagnostic hypotheses. | 9,323 |
descriptions multimodal action in work logic. about The domain is present changing | The present work is about changing action domain descriptions in multimodal logic. | 9,324 |
method the be intensive. can Consequently, computationally extremely | Consequently, the method can be extremely computationally intensive. | 9,325 |
for We expensive that to are proposals avoid rejected. therefore be calculations likely | We therefore avoid expensive calculations for proposals that are likely to be rejected. | 9,326 |
additional comes model Our efficient. with is that advantage, the trained inference extremely along | Our trained model comes along with the additional advantage, that inference is extremely efficient. | 9,327 |
candidates: This family concentrates paper search. of counting-based on one | This paper concentrates on one family of candidates: counting-based search. | 9,328 |
other search generally heuristics. results that show counting-based Experimental outperforms generic | Experimental results show that counting-based search generally outperforms other generic heuristics. | 9,329 |
this problem In in an paper, system. address the we argumentation abstract change of | In this paper, we address the problem of change in an abstract argumentation system. | 9,330 |
more according may applications. specific these less properties desirable All to or be | All these properties may be more or less desirable according to specific applications. | 9,331 |
preferred are semantics: the and semantics. They studied under grounded two particular | They are studied under two particular semantics: the grounded and preferred semantics. | 9,332 |
image produces output. fused Applying to the algorithm final deconvolution the blind a | Applying a blind deconvolution algorithm to the fused image produces the final output. | 9,333 |
the presence in discuss We then cost functions. of configuration multiple interactive | We then discuss interactive configuration in the presence of multiple cost functions. | 9,334 |
instances. of even fraction a are very times second generally within Response for large a | Response times are generally within a fraction of a second even for very large instances. | 9,335 |
methods usefulness by of The the numerical are illustrated results. thorough proposed | The usefulness of the proposed methods are illustrated by thorough numerical results. | 9,336 |
research. active act area observable partially remains to how an of Deciding in environments | Deciding how to act in partially observable environments remains an active area of research. | 9,337 |
problem, been this to have overcome In order approaches proposed. many | In order to overcome this problem, many approaches have been proposed. | 9,338 |
Among ones. are variants and them, ILAO* of RTDP state-of-the-art | Among them, ILAO* and variants of RTDP are state-of-the-art ones. | 9,339 |
analysis reachability heuristic some search methods backups. These avoid unnecessary and use to | These methods use reachability analysis and heuristic search to avoid some unnecessary backups. | 9,340 |
MDP we algorithms. this paper, optimal present two In | In this paper, we present two optimal MDP algorithms. | 9,341 |
other close-to-equal-sized when an algorithms TVI multiple, outperforms has VI state-of-the-art MDP SCCs. and vastly | TVI outperforms VI and other state-of-the-art algorithms vastly when an MDP has multiple, close-to-equal-sized SCCs. | 9,342 |
topological value extension of second TVI. algorithm, an iteration The is focused (FTVI), | The second algorithm, focused topological value iteration (FTVI), is an extension of TVI. | 9,343 |
its for MDP. FTVI components connected that to relevant attention restricts are solving the | FTVI restricts its attention to connected components that are relevant for solving the MDP. | 9,344 |
magnitude, of domains. averaged order demonstrate by FTVI outperforms that an across We several TVI | We demonstrate that FTVI outperforms TVI by an order of magnitude, averaged across several domains. | 9,345 |
or advances activities. to in lead of completion delays | lead to delays or advances in completion of activities. | 9,346 |
to that between provide we dependencies enhancements search Furthermore, local exploit also activities. temporal | Furthermore, we also provide enhancements to local search that exploit temporal dependencies between activities. | 9,347 |
prune variables a able its is explanation. result, to MRE less As relevant from automatically | As a result, MRE is able to automatically prune less relevant variables from its explanation. | 9,348 |
heuristic to planning for expensive functions Current are evaluation compute. | Current evaluation functions for heuristic planning are expensive to compute. | 9,349 |
policy. as The first action classifier resulting using of consists the one an | The first one consists of using the resulting classifier as an action policy. | 9,350 |
Drake, with work executive This for dynamic temporal plans a choice. presents | This work presents Drake, a dynamic executive for temporal plans with choice. | 9,351 |
on of representation non-dominated maintaining maintenance the minimal a focuses system particular, In constraints. | In particular, the maintenance system focuses on maintaining a minimal representation of non-dominated constraints. | 9,352 |
American-style program Dr.Fill, We solves puzzles. that crossword describe a | We describe Dr.Fill, a program that solves American-style crossword puzzles. | 9,353 |
formally then are and studied induced The empirically. admissible heuristics | The induced admissible heuristics are then studied formally and empirically. | 9,354 |
We on networks. large-scale experimentally Bayesian real techniques randomly generated evaluated our and | We experimentally evaluated our techniques on large-scale real and randomly generated Bayesian networks. | 9,355 |
up as As they problems become larger. well scale result, a | As a result, they scale up well as problems become larger. | 9,356 |
the parameter Estimation methodology. crucial is transformation this in of | Estimation of the transformation parameter is crucial in this methodology. | 9,357 |
An is for covariate comparative purposes. method also artificial included | An artificial covariate method is also included for comparative purposes. | 9,358 |
to the are Simulation studies proposed the of implemented methods. compare effectiveness | Simulation studies are implemented to compare the effectiveness of the proposed methods. | 9,359 |
methods are data illustrated on real life also The two different applications. | The methods are also illustrated on two different real life data applications. | 9,360 |
for an R Moreover, package proposed implementation. AID is | Moreover, an R package AID is proposed for implementation. | 9,361 |
several probabilistic rules model a relational world promising for are representation Noisy reasons. | Noisy probabilistic relational rules are a promising world model representation for several reasons. | 9,362 |
over world instantiations. compact and generalize are They | They are compact and generalize over world instantiations. | 9,363 |
grounded rules We relational in domains. such investigate reasoning with | We investigate reasoning with such rules in grounded relational domains. | 9,364 |
efficient the for and decision-theoretic compactness of flexible rules algorithms Our planning. exploit | Our algorithms exploit the compactness of rules for efficient and flexible decision-theoretic planning. | 9,365 |
Empirical our methods methods that results fail. can where solve existing problems show | Empirical results show that our methods can solve problems where existing methods fail. | 9,366 |
execution system Our and preferences. handles failures multi-objective | Our system handles execution failures and multi-objective preferences. | 9,367 |
problem throughout important and machine features structure in are planning. learning representing decision-theoretic Domain-specific | Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. | 9,368 |
features often crafted in domains applications experts. real-world human Successful by require | Successful applications in real-world domains often require features crafted by human experts. | 9,369 |
first Our successfully domain-independent human-engineered provides (without that plays features). the Tetris approach method | Our method provides the first domain-independent approach that plays Tetris successfully (without human-engineered features). | 9,370 |
some relation. We establish dominance key of properties the | We establish some key properties of the dominance relation. | 9,371 |
negative different give properties results results. also complexity few and underlie novel which a some | different properties and also give a few novel complexity results which underlie some negative results. | 9,372 |
optimization differentiation the We implicit the bi-level solve using technique. problem | We solve the bi-level optimization problem using the implicit differentiation technique. | 9,373 |
of priors. Under of framework, compare we the unified the performance two can this types | Under this unified framework, we can compare the performance of the two types of priors. | 9,374 |
computationally I-DIDs expect, solving As we is hard. may | As we may expect, solving I-DIDs is computationally hard. | 9,375 |
methods these into aggregating equivalence models involve Both individual classes. | Both these methods involve aggregating individual models into equivalence classes. | 9,376 |
we equivalent identical time actions single that cluster at prescribe step. actionally a models Specifically, | Specifically, we cluster actionally equivalent models that prescribe identical actions at a single time step. | 9,377 |
to us identifying the require set. would initial Exactly models all the solve in equivalences | Exactly identifying the equivalences would require us to solve all models in the initial set. | 9,378 |
models, an We solving approximation. of this avoid selectively by some the introducing thereby | We avoid this by selectively solving some of the models, thereby introducing an approximation. | 9,379 |
Not are domains commonly dynamic, Markov where used. in however, stochastic processes so, decision | Not so, however, in dynamic, stochastic domains where Markov decision processes are commonly used. | 9,380 |
domains and exploit. method which the can of assess We our features analyse | We assess and analyse the features of domains which our method can exploit. | 9,381 |
and delete both for planning. lists relaxation optimal paramount The importance satisficing ignoring of is | The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. | 9,382 |
establish between connections topology. causal structure and graph We h+ | We establish connections between causal graph structure and h+ topology. | 9,383 |
methods, call we This polynomial results TorchLight. in time a analysis low-order implemented tool in | This results in low-order polynomial time analysis methods, implemented in a tool we call TorchLight. | 9,384 |
domains way, can distinguish TorchLight ones. hard easy from In this | In this way, TorchLight can distinguish easy domains from hard ones. | 9,385 |
path planning problem is challenging real-life with Multi-agent a numerous applications. | Multi-agent path planning is a challenging problem with numerous real-life applications. | 9,386 |
tractable algorithm introduce on MAPP, a undirected for multi-agent graphs. path We planning | We introduce MAPP, a tractable algorithm for multi-agent path planning on undirected graphs. | 9,387 |
basic version extensions. and a several We present | We present a basic version and several extensions. | 9,388 |
on grid were game Experiments maps. run realistic | Experiments were run on realistic game grid maps. | 9,389 |
be across can instances re-used map. Parts on same MAPPs computation of the | Parts of MAPPs computation can be re-used across instances on the same map. | 9,390 |
reasoning to investigate an approach through argumentation. about causes We | We investigate an approach to reasoning about causes through argumentation. | 9,391 |
a about consider model We causal system, look for a facts. arguments and physical for | We consider a causal model for a physical system, and look for arguments about facts. | 9,392 |
work Argumentation explaining from various then links. at these is | Argumentation is then at work from these various explaining links. | 9,393 |
based search. LAMA on is classical a heuristic system forward planning | LAMA is a classical planning system based on heuristic forward search. | 9,394 |
We into that transformed the spatial be can visual observe domain/task-specific domain/task-independent perceptions/actions problems. | We observe that the domain/task-specific visual perceptions/actions can be transformed into domain/task-independent spatial problems. | 9,395 |
The the efficacy idea complexity shown of is analysis. by time | The efficacy of the idea is shown by time complexity analysis. | 9,396 |
of constraint formulations problem. We present programming the several | We present several constraint programming formulations of the problem. | 9,397 |
Boolean linear present maximum formulations satisfiability also and weighted using partial programming. We integer mixed | We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. | 9,398 |
on discuss We different coevolutionary effect the the deletion mechanisms spacer of dynamics. | We discuss the effect of different spacer deletion mechanisms on the coevolutionary dynamics. | 9,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.