Sciweavers

784 search results - page 77 / 157
» Relaxing the Value Restriction
Sort
View
CP
2005
Springer
14 years 2 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
IJCNLP
2005
Springer
14 years 2 months ago
Regularisation Techniques for Conditional Random Fields: Parameterised Versus Parameter-Free
Recent work on Conditional Random Fields (CRFs) has demonstrated the need for regularisation when applying these models to real-world NLP data sets. Conventional approaches to regu...
Andrew Smith, Miles Osborne
ADC
2004
Springer
106views Database» more  ADC 2004»
14 years 2 months ago
Customizing Internal Activity Behaviour for Flexible Process Enforcement
Workflow technology has met with success in a variety of industries, although several limitations have emerged. One such drawback is the inflexibility of specification languages, ...
Belinda M. Carter, Joe Y.-C. Lin, Maria E. Orlowsk...
CISIS
2010
IEEE
14 years 2 months ago
Semantic Web Fostering Enterprise 2.0
—The term Enterprise 2.0 applies to the use of Web 2.0 technologies as a support for business activities within the organizations. These technologies are exploited to foster inte...
Nicola Capuano, Matteo Gaeta, Francesco Orciuoli, ...
CIAC
2003
Springer
110views Algorithms» more  CIAC 2003»
14 years 2 months ago
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
Euripides Markou, Stathis Zachos, Christodoulos Fr...