Sciweavers

2657 search results - page 59 / 532
» On the complexity of hierarchical problem solving
Sort
View
SIAMJO
2010
135views more  SIAMJO 2010»
14 years 12 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
ICDM
2009
IEEE
148views Data Mining» more  ICDM 2009»
15 years 8 months ago
Hierarchical Bayesian Models for Collaborative Tagging Systems
—Collaborative tagging systems with user generated content have become a fundamental element of websites such as Delicious, Flickr or CiteULike. By sharing common knowledge, mass...
Markus Bundschus, Shipeng Yu, Volker Tresp, Achim ...
GECCO
2009
Springer
15 years 6 months ago
Problem decomposition using indirect reciprocity in evolved populations
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...
Heather Goldsby, Sherri Goings, Jeff Clune, Charle...
PODS
2003
ACM
132views Database» more  PODS 2003»
16 years 1 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
15 years 5 months ago
CHDStd - application support for reusable hierarchical interconnect timing views
This paper describes an important new facility for timing-driven design applications within the new CHDStd standard for a SEMATECH design system for large complex chips. We first ...
S. Grout, G. Ledenbach, R. G. Bushroe, P. Fisher, ...