Sciweavers

1760 search results - page 88 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
COMPGEOM
1994
ACM
14 years 13 days ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Publication
243views
14 years 7 months ago
A Java-based Wrapper for Wireless Communications
The increasing number of new applications for mobile devices in pervasive environments, do not cope with changes in the wireless communications. Developers of such applications hav...
Alessandro Genco, Antonio Gentile, Cono Ferrarotto...
IJHIS
2007
89views more  IJHIS 2007»
13 years 8 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
ACL
2010
13 years 6 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
AAAI
2000
13 years 9 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski