Sciweavers

1968 search results - page 175 / 394
» The Complexity of Valued Constraint Models
Sort
View
FOIKS
2006
Springer
15 years 5 months ago
Consistency Checking Algorithms for Restricted UML Class Diagrams
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
Ken Kaneiwa, Ken Satoh
113
Voted
JMMA
2010
90views more  JMMA 2010»
14 years 8 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
ISDA
2010
IEEE
14 years 11 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
101
Voted
VTC
2007
IEEE
15 years 8 months ago
Q-Learning-based Hybrid ARQ for High Speed Downlink Packet Access in UMTS
Abstract-In this paper, a Q-learning-based hybrid automatic repeat request (Q-HARQ) scheme is proposed to achieve efficient resource utilization for high speed downlink packet acc...
Chung-Ju Chang, Chia-Yuan Chang, Fang-Ching Ren
ATAL
2005
Springer
15 years 7 months ago
Bumping strategies for the multiagent agreement problem
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...
Pragnesh Jay Modi, Manuela M. Veloso