Sciweavers

4047 search results - page 58 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
DM
2011
223views Education» more  DM 2011»
14 years 6 months ago
On graph equivalences preserved under extensions
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
Zbigniew Lonc, Miroslaw Truszczynski
AAAI
2006
15 years 1 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi
CIMCA
2005
IEEE
15 years 5 months ago
A GRASP with Adaptive Memory for a Period Vehicle Routing Problem
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
Luciana B. Goncalves, Luiz Satoru Ochi, Simone L. ...
IWPEC
2004
Springer
15 years 5 months ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 10 months ago
Beyond isolation: research opportunities in declarative data-driven coordination
There are many database applications that require users to coordinate and communicate. Friends want to coordinate travel plans, students want to jointly enroll in the same set of ...
Lucja Kot, Nitin Gupta 0003, Sudip Roy, Johannes G...