Sciweavers

705 search results - page 132 / 141
» Approximating Extended Answer Sets
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 1 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
SI3D
2009
ACM
15 years 4 months ago
Crowd patches: populating large-scale virtual environments for real-time applications
Populating virtual environments (VEs) with large crowds is a subject that has been tackled for several years. Solutions have been proposed to offer realistic trajectories as well ...
Barbara Yersin, Jonathan Maïm, Julien Pettr&e...
FOCS
2009
IEEE
15 years 4 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...
INFOVIS
2005
IEEE
15 years 3 months ago
The Visual Code Navigator: An Interactive Toolset for Source Code Investigation
We present the Visual Code Navigator, a set of three interrelated visual tools that we developed for exploring large source code software projects from three different perspective...
Gerard Lommerse, Freek Nossin, Lucian Voinea, Alex...
FQAS
2006
Springer
101views Database» more  FQAS 2006»
15 years 1 months ago
Cooperative Discovery of Interesting Action Rules
Action rules introduced in [12] and extended further to e-action rules [21] have been investigated in [22], [13], [20]. They assume that attributes in a database are divided into t...
Agnieszka Dardzinska, Zbigniew W. Ras