Sciweavers

291 search results - page 37 / 59
» On Generalizing Pawlak Approximation Operators
Sort
View
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 8 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGUCCS
2003
ACM
14 years 1 months ago
Teamwork is the heart of technology
IAT Services, the central Information Technology group at the University of Missouri-Columbia, operates computing sites in general access, classroom, and residence hall settings. ...
Tammy Hohlt, Kristina A. Cunningham
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
14 years 9 days ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
INFOCOM
2008
IEEE
14 years 3 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 21 days ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi